Ignatius and the Princess IV

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

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<set>
#include<queue>
#include<stack>
#include<vector>
#include<map>

#define N 1000010
#define Mod 10000007
#define lson l,mid,idx<<1
#define rson mid+1,r,idx<<1|1
#define lc idx<<1
#define rc idx<<1|1
const double EPS = 1e-11;
const double PI = acos ( -1.0 );
const double E = 2.718281828;
typedef long long ll;

const int INF = 1000010;

using namespace std;

int a[N];
int n;

int main() {
    while(cin>>n) {
        for(int i=0; i<n; i++) {
            scanf("%d",&a[i]);
        }
        sort(a,a+n);
        int Min=INF,time=1,it=0;
        int t=(n+1)/2;
        for(int i=1; i<n; i++) {
            if(a[i]==a[i-1])time++;
            else if(abs(time-t)<Min) {
                Min=abs(time-t);
                it=i-1;
                time=1;
            }
        }
        if(a[n-1]==a[n-2]&&abs(time-t)<Min)it=n-1;
        cout<<a[it]<<endl;
    }
    return 0;
}

hdu1029 Ignatius and the Princess IV

原文：http://blog.csdn.net/acm_baihuzi/article/details/44504997