HDU 1029 - Ignatius and the Princess IV

#include <iostream>
#include <map>
using namespace std;
map <int, int>ma;
int n, t, re;
int main()
{
while (scanf("%d", &n) != EOF){
for (int i=0; i<n; i++){
scanf("%d", &t);
ma[t]++;
if (ma[t] > n/2)
re = t;
}
printf("%d\n", re);
ma.clear();
}
return 0;
}