hdoj 1029 Ignatius and the Princess IV

Ignatius and the Princess IV

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


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
 

Sample Output
 
  
3 5 1
 
At the beginning, I thought it was a conventional thinking question. Just calculate the number of each number, and then sort the numbers. If the number of the largest number is greater than (N+1)/2, then output the corresponding number, I don't either. I know what's wrong. I read other people's blogs and think this is actually a thinking problem. If the number of numbers is greater than (N+1)/2, it means that if the numbers are sorted from small to large, (N+1)/2 The position must be the required number
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int num[1000005];
int main(){
	//freopen("test.in","r",stdin);
	int N;
	while(scanf("%d",&N)!=EOF){
		memset(num,0,sizeof(num));
		for(int i=1;i<=N;i++){
			scanf("%d",&num[i]);
		}
		sort(num+1,num+1+N);
		printf("%d\n",num[(N+1)/2]);
	}
	return 0;
}

Guess you like

Origin http://43.154.161.224:23101/article/api/json?id=324671393&siteId=291194637