水题,不说什么,上代码
#include<iostream>
#include<map>
using namespace std;
int main(){
int max,maxnum,i,N,num;
map<int,int> count;
while(scanf("%d",&N)!=EOF){
count.erase(count.begin(),count.end());
for(i=0;i<N;i++){
scanf("%d",&num);
count[num]++;
}
max=0;
maxnum=0;
for(i=0;i<count.size();i++)
if(max<count[i]){
max=count[i];
maxnum=i;
}
printf("%d\n",maxnum);
}
return 0;
}