#include <cstdio>
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define REP(x,l,u) for(int x = (l);x<=(u);x++)
const int maxn=999999+100;
void init () {
// Init Everything Here
ios::sync_with_stdio ( false );
}
int main() {
init();
int n;
while(cin>>n) {
map<int,int> mp;
int num;
REP(i,1,n) {
scanf("%d",&num);
if(!mp.count(num)) mp[num]=0;
mp[num]++;
if(mp[num]==(n+1)/2) {
cout<<num<<endl;
continue;
}
}
}
return 0;
}
hdu 1029 Ignatius and the Princess IV
最新推荐文章于 2017-10-27 20:23:06 发布