|
||||||||||
who is the best?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1314 Accepted Submission(s): 766 Problem Description There are N people want to choose the best person. Each person select the best person $a_i$, .John wants to know that who received the most number of votes. Input The first line contains a single integer $T(1 \leq T \leq 50)$,indicating the number of test cases. Each test case begins with an integer $N(1 \leq N \leq 100)$,indicating the number of person. Next N lines contains an integer $a_i(1 \leq a_i \leq 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
Sample Output
Source | ||||||||||
|