hdu 5123 超水題..

http://acm.hdu.edu.cn/showproblem.php?pid=5123

太水了

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <queue>
#include <map>
#include <iostream>
#include <sstream>
#include <algorithm>
using namespace std;
#define RD(x) scanf("%d",&x)
#define RD2(x,y) scanf("%d%d",&x,&y)
#define RD3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define clr0(x) memset(x,0,sizeof(x))
#define clr1(x) memset(x,-1,sizeof(x))
#define eps 1e-9
const double pi = acos(-1.0);
typedef long long LL;
const int inf = 1000000000;
const int maxn = 105;
int s[maxn];
int work()
{
    clr0(s);
    int n,x;
    RD(n);
    for(int i = 0;i < n;++i){
        RD(x);
        s[x]++;
    }
    int ans = 1;
    for(int i = 1;i <= n;++i){
        if(s[ans] < s[i])
            ans = i;
    }
    return ans;
}
int main()
{
    int _;
    RD(_);
    while(_--){
        printf("%d\n",work());
    }
    return 0;
}