#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
vector<int> input;
int n=0;
cin>>n;
for(int i=0;i<n;i++){
int m=0;
cin>>m;
input.push_back(m);
}
long max=0;
int res=-1;
for(int i=0;i<n;i++){
int m=input[i];
long tot=count(input.begin(),input.end(),m);
if(tot==max){
if(input[i]<res||res==-1){
res=input[i];
}
}
if(tot>max){
max=tot;
res=input[i];
}
}
cout<<res<<endl;
}
CCF CSP 201312-1 The most frequent occurrences
Guess you like
Origin blog.csdn.net/Cindy_00/article/details/108435559
Recommended
Ranking