CCF201312-1 出现次数最多的数

#include <iostream>
using namespace std;

const int N = 10001;
int a[N];

int main(){

int n, res = 0, max = 0,tmp;
cin >> n;
while(n--){
cin >> tmp;
a[tmp]++;
max = max > tmp ? max:tmp;
}
for(int i = 1;i <= max ;i++){
if(a[i] > a[res])
res = i;
}
cout << res << endl;



return 0;
}