zoj 3869 Ace of Aces

最新推荐文章于 2017-07-21 10:44:38 发布

原创最新推荐文章于 2017-07-21 10:44:38 发布 · 581 阅读

0 ·

CC 4.0 BY-SA版权

水题专栏收录该内容

127 篇文章

订阅专栏

本文详细介绍了如何使用编程帮助TSAB确定Ace of Aces的选举过程，包括输入处理、数据排序及输出结果。通过解析投票票数，识别获得最多提名的候选人。若提名数量相等，则输出'Nobody'。代码示例涵盖了数组操作、比较函数及基本的输入输出流程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Ace of Aces

Time Limit: 2 Seconds Memory Limit: 65536 KB

There is a mysterious organization called Time-Space Administrative Bureau (TSAB) in the deep universe that we humans have not discovered yet. This year, the TSAB decided to elect an outstanding member from its elite troops. The elected guy will be honored with the title of "Ace of Aces".

After voting, the TSAB received N valid tickets. On each ticket, there is a number A_i_{_{denoting the ID of a candidate. The candidate with the most tickets nominated will be elected as the "Ace of Aces". If there are two or more candidates
have the same number of nominations, no one will win.}}

Please write program to help TSAB determine who will be the "Ace of Aces".

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains an integer N (1 <= N <= 1000). The next line contains N integers A_i (1 <= A_i <= 1000).

Output

For each test case, output the ID of the candidate who will be honored with "Ace of Aces". If no one win the election, output "Nobody" (without quotes) instead.

Sample Input

Sample Output

2
Nobody
998

找出出现次数最多的数，若有多个输出nobody

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<algorithm>
#define MAX 1000+1
using namespace std;
struct record
{
    int ID,sum;
}num[MAX];
bool cmp(record x,record y)
{
    return x.sum>y.sum;
}
int main()
{
    int t,n,i,j;
    int a;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        memset(num,0,sizeof(num));
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a);
            num[a].ID=a;
            num[a].sum++;
        }
        sort(num,num+MAX,cmp);
        if(num[0].sum==num[1].sum)
        printf("Nobody\n");
        else
        printf("%d\n",num[0].ID);
    }
    return 0;
}