J - Ignatius and the Princess IV（HDU 1029）

“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

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

Sample Output

3
5
1

题解

题意：

• 对于给定的一组个数为n的数据，n为奇数，有且仅有某一个数字出现次数大于等于(n+1)/2，输出这个数字

思路：

• 当读入数字a时，num[a]++，若num[a] 是否等于(n+1)/2，则输出a，否则继续读入，直到读取结束。（不用担心重复输出）

Code

#include<iostream>
#include<memory.h> 
#include<string.h> 
#include<cstring>
using namespace std;

int num[1000000];
int main()
{
	int N, a, mid;
	while (cin >> N)
	{
        mid = (N + 1) / 2;
		//memset(num, 0, sizeof(num));//将数组重置为0；不重置也没啥问题
		for (int i = 0; i < N; i++)
		{   
			cin >> a;
			num[a]++;
			if (num[a] == mid)
				cout << a << endl;
		}
	}
		return 0;
}