HDU 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): 34165    Accepted Submission(s): 14876

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

题目大意：给你一个数n，然后再给n个数，一定有一个数出现了(n+1)/2次，找出这个数；

看似很麻烦，需要对出现的数进行计数，然后找出现次数最多的那个数；

其实并不需要，只要将数组进行排序，然后输出中间那个数即可。

#include <iostream>#include <cstdio>#include <cmath>#include <algorithm>#define N 1000000using namespace std;int a[N];int main(){    int n;    while(~scanf("%d",&n)){        for(int i=0;i<n;i++)            scanf("%d",&a[i]);        sort(a,a+n);        printf("%d\n",a[(n-1)/2]);    }    return 0;}