HDU 1029 Ignatius and the Princess IV

参考：https://blog.csdn.net/chudongfang2015/article/details/51378036

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=1e6+10;
int a[N];
int main()
{
    int n;
    while (cin>>n)
    {
        for (int i=0;i<n;i++)
        {
            cin>>a[i];
        }
        sort(a,a+n);
        int flag=(n+1)/2,f=1;
        for (int i=0;i<n;i++)
        {
            if (a[i]=a[i+1])
            {
                f++;
                if (f>=flag)
                {
                    cout<<a[i]<<endl;
                    break;
                }
            }
            else
            {
                f=1;
            }
        }
    }

    return 0;
}