水题。。类似桶排的思路- -
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=500000;
int a[maxn];
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
memset(a,0,sizeof(a));
int id=-1;
for(int i=0;i<n;i++)
{
int t;
scanf("%d",&t);
a[t]++;
if(a[t]>=(n+1)/2)
id=t;
}
printf("%d\n",id);
}
return 0;
}