Input:"OK, you are not too bad, em... But you can never pass the next test." feng5166 says.
"I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tell me which integer is the special one after I tell you all the integers." feng5166 says.
"But what is the characteristic of the special integer?" Ignatius asks.
"The integer will appear at least (N+1)/2 times. If you can't find the right integer, I will kill the Princess, and you will be my dinner, too. Hahahaha....." feng5166 says.
Can you find the special integer for Ignatius?
Output:The input contains several test cases. Each test case contains two lines. The first line consists of an odd integer N(1<=N<=999999) which indicate the number of the integers feng5166 will tell our hero. The second line contains the N integers. The input is terminated by the end of file.
Sample Input:For each test case, you have to output only one line which contains the special number you have found.
Sample Output:5
1 3 2 3 3
11
1 1 1 1 1 5 5 5 5 5 5
7
1 1 1 1 1 1 1
3
5
1
(唉,真的很难见到杭电有这么水的题了!!!)
程序代码:
#include<stdio.h>
#define N 1000000
int a[N];
int main()
{
int i,n,t,ans;
while(scanf("%d",&n)!=EOF)
{
for(i=0;i<n;i++)
{
scanf("%d",&t);
a[t]++;
if(a[t]>=(n+1)/2)
ans=t;
}
printf("%d\n",ans);
}
return 0;
}