HDOJ--1029--Ignatius and the Princess IV

题目描述：
“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?
输入描述:
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.
输出描述:
For each test case, you have to output only one line which contains the special number you have found.
输入：
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
输出：
3
5
1
题意：
给你n个数字，你需要找出出现至少(n+1)/2次的数字 现在需要你找出这个数字是多少？
题解：
排序了直接搞
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

const int maxn = 999999 + 5;
int a[maxn];

int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        for(int i = 0; i < n; i ++) scanf("%d",&a[i]);
        sort(a,a + n);
        printf("%d\n",a[(n + 1) / 2]);
    }
    return 0;
}