CCF 出现次数最多的数

#include <iostream>
#include <math.h>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;

int main()
{
    int n,a[10005],m;
    cin >> n;
    memset(a,0,sizeof(a));
    while(n--){
        cin >> m;
        a[m]++;
    }
    int maxm = -1,maxnum = 0;
    for(int i = 0; i < 10001;i++){
        if(a[i] > maxm){
            maxm = a[i];
            maxnum = i;
        }
    }
    cout<<maxnum<<endl;
    return 0;
}