hdu 1029 Ignatius and the Princess IV

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

int dp[2000000];
int main()
{
int N;
int i;
int m;
int max;
int temp;
while(scanf("%d",&N)!=EOF)
{
for(i=0;i<=1100000;i++)
{
dp[i]=0;
}
for(i=1;i<=N;i++)
{
scanf("%d",&m);
dp[m]++;
}
max=0;
for(i=0;i<=1100000;i++)
{
if(max<dp[i])
{
max=dp[i];
temp=i;
}
}
printf("%d\n",temp);
}
return 0;
}