Ignatius and the Princess IV 水

#include <iostream>
#include <algorithm>
#define maxn 1000000
int my[maxn];
using namespace std;
int main(){
    int n;

    while(cin>>n){
        for(int i=0;i<n;++i)
            cin>>my[i];
        int special_number=(n+1)/2;
        sort(my,my+n);
        for(int i=0;i<n;++i){
            int ans=1;
            bool flag=false;
            while(my[i]=my[i+1]){
                if(++ans>=special_number){
                    cout<<my[i]<<'\12';
                    flag=true;
                    break;
                    }
                i++;
            }
            if(flag)break;
        }
    }
    return 0;
}