#include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
using namespace std;
int a[2000];
int main()
{
int n;
cin >> n;
int m;
for(int i = 1; i <= n; i++)
{
memset(a, 0, sizeof(a));
scanf("%d", &m);
int t;
for(int j = 1; j <= m; j++)
{
scanf("%d", &t);
a[t]++;
}
int maxn = 0, maxn1 = 0;
for(int j = 1; j <= 1001; j++)
{
if(a[j] > maxn)
maxn = a[j], maxn1 = j;
}
int flag = 0;
for(int j = 1; j <= 1001; j++)
{
if(maxn == a[j] && maxn1 != j)
{
cout << "Nobody" << endl;
flag = 1;
break;
}
}
if(flag == 0)
{
cout << maxn1 << endl;
}
}
return 0;
}
ZOJ - 3869
最新推荐文章于 2020-09-06 21:49:48 发布