HDU 1029 Ignatius and the Princess IV --- 水题

/* HDU 1029 *Ignatius and the Princess IV --- dp */
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
using namespace std;

const int maxn = 1000005;
int a[maxn];

map<int, int> m;

int main()
{
#ifdef _LOCAL
    freopen("D:\\input.txt", "r", stdin);
#endif

    int n;
    int ans;
    while (scanf("%d", &n) == 1){
        m.clear();    //记得清空原有的东西
        for (int i = 1; i <= n; ++i){
            scanf("%d", a + i);
            ++m[a[i]];
            if (m[a[i]] == (n + 1) / 2){
                ans = a[i];
            }
        }//for(i)
        printf("%d\n", ans);
    }

    return 0;
}