H电-Problem Archive-5123-who is the best?

who is the best?

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 210    Accepted Submission(s): 143

Problem Description

There are N people want to choose the best person. Each person select the best person  ai, .John wants to know that who received the most number of votes.

 

Input

The first line contains a single integer  T(1≤T≤50),indicating the number of test cases.
Each test case begins with an integer  N(1≤N≤100),indicating the number of person.
Next N lines contains an integer  ai(1≤ai≤N).

 

Output

For each case, output an integer means who is the best person. If there are multiple answers, print the minimum index.

 

Sample Input

21012345678910533333

 

Sample Output

13

 

Source

BestCoder Round #20

秒过小题，轻松一下 （=   。 =）

S：

#include<stdio.h>
#include<string.h>

int main(){
    int T, N[105], p, pp, v, ans;

    scanf("%d", &T);
    while(T--){
        memset(N, 0, sizeof(N));
        scanf("%d", &p);
        pp = p;
        while(p--){
            scanf("%d", &v);
            N[v] = N[v] + 1;
        }
    ans = 1;
    for(int i = 0; i < pp; i++){
        if(N[i] > N[ans]) ans = i;
    }
    printf("%d\n", ans);
    }
    return 0;
}