HDU1029-Ignatius and the Princess IV

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

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


水题，找到出现了最少（n+1）/2次的数，排好序之后遍历过去，遇到不同的数，之前这个数出现的次数大于（n+1）/2，则调出循环，直接输出，
如果不大于，则从这个数开始遍历；计数次数归0；

做这道题的时候运行起来总是突然中止，后来发现是排序时候的sizeof问题，用qsort排序，第三个参数是单个元素的大小，不是数组总大小；

代码如下：

#include <stdio.h>
#include <stdlib.h>
#define maxn 1000000
int b[maxn];
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int cmp(const void*x,const void*y)
{
	return *(int*)x-*(int*)y;
}
int main(int argc, char *argv[])
{
	int n,f,c,i;
	while(scanf("%d",&n)!=-1)
	{
		
		for(i=0;i<n;i++)
			scanf("%d",&b[i]);
		qsort(b,n,sizeof(*b),cmp);//是sizeof(*b)或者sizeof（int）而不是sizeof（b） 
		f=b[0];c=0;
		for(i=0;i<n;i++)
		{
			if(b[i]==f)
				c++;
			else
			{
				if(c>=(n+1)/2)
					break;
				
				f=b[i];
				c=0;
			}
			
		}
		printf("%d\n",f);
	}
	return 0;
}