303. 众数-计算机一2014

#include <iostream>
#include <cstdio>
#include <map>
#include <algorithm>
#include <vector>
using namespace std;
map<int,int> M;
bool cmp(const pair<int, int> &x,const pair<int, int> &y){
    return x.second > y.second || (x.second == y.second && x.first < y.first);
}
int main(int argc, char** argv) {
	int T;
	scanf("%d", &T);
	while (T--) {
		int N;
		M.clear();
		scanf("%d", &N);
		for (int i = 0; i < N; ++i) {
			int now;
			scanf("%d", &now);
			if (M.find(now) == M.end()) M[now] = 1;
			else ++M[now];
		}
		vector<pair<int, int> > vec(M.begin(), M.end());
		sort(vec.begin(), vec.end(), cmp);
		printf("%d\n", vec.begin()->first);
	}	
	return 0;
}