Ignatius and the Princess IV hdu 1029

Ignatius and the Princess IV

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32767 K (Java/Others) Total Submission(s): 41121    Accepted Submission(s): 17962

Problem Description

"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?

Input

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.

Output

For each test case, you have to output only one line which contains the special number you have found.

Sample Input

51 3 2 3 3111 1 1 1 1 5 5 5 5 5 571 1 1 1 1 1 1

Sample Output

351

Author

Ignatius.L

Recommend

We have carefully selected several similar problems for you:  1040 1074 1171 1203 1087

多元素问题，一组数一个数出现次数大于n/2。

用计数器记录元素出现次数，初始化tp=第一个数，count=1;

然后继续输入x，若tp=x,count就++否则减减；当它等于零就换一个数。

#include <iostream> using namespace std; int main() {    int N;    while(cin>>N)    {  int tp=0,count=0,x=0; for(int i=0;i<N;i++)     { scanf("%d",&x); if(count==0) tp=x,count=1; else { if(tp==x)count++; else count--; } }    printf("%d\n",tp);    }   return 0;  }