hdu 1029 Ignatius and the Princess IV

#include<iostream>
#include<algorithm>
#include<string.h>
#include<stdio.h>
using namespace std;
int dp[1000010];
int main()
{
    int n,b,num;
    while(scanf("%d",&n)!=EOF)
    {
        num=0;
        memset(dp,0,sizeof(dp));
        int k=n;
        while(k--)
        {
            scanf("%d",&b);
            dp[b]++;
            if(dp[b]==(n+1)/2)
            {
                num=b;
            }
        }
        cout<<num<<endl;
    }
}