zoukankan      html  css  js  c++  java
  • who is the best?

    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

    2 10 1 2 3 4 5 6 7 8 9 10 5 3 3 3 3 3
                  

    Sample Output

    1 3
     
     
     
     
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 using namespace std;
     5 int main()
     6 {
     7     int t,n,num,maxn;
     8     int a[1000];
     9     scanf("%d",&t);
    10     while(t--)
    11     {
    12         scanf("%d",&n);
    13         maxn=-1;
    14         memset(a,0,sizeof(a));
    15         for(int i=1;i<=n;i++)
    16         {
    17             scanf("%d",&num);
    18             a[num]++;
    19             if(a[num]>maxn)
    20             {
    21                 maxn=a[num];
    22             }
    23         }
    24         for(int i=1;i<=n;i++)
    25         {
    26             if(a[i]==maxn)
    27             {
    28                 printf("%d
    ",i);
    29                 break;
    30             }
    31         }
    32     }
    33     return 0;
    34 }
  • 相关阅读:
    c++:函数模板
    1084 外观数列
    1083 是否存在相等的差
    1082 射击比赛
    1081 检查密码
    1080 MOOC期终成绩
    1079 延迟的回文数
    1078 字符串压缩与解压
    1077 互评成绩计算
    1076 Wifi密码
  • 原文地址:https://www.cnblogs.com/wangmengmeng/p/4552740.html
Copyright © 2011-2022 走看看