BC who is the best?（HDU 5123）

最新推荐文章于 2024-08-26 15:30:00 发布

CODE_BALL

最新推荐文章于 2024-08-26 15:30:00 发布

阅读量877

点赞数

CC 4.0 BY-SA版权

分类专栏： OJ

本文链接：https://blog.youkuaiyun.com/codeball/article/details/41620253

OJ 专栏收录该内容

23 篇文章

订阅专栏

本文介绍了一个简单的算法，用于从一组候选人中通过投票选出最佳人选。该算法考虑了当出现票数相同的情况时选择编号最小的人作为胜出者。通过使用结构体存储候选人信息并借助排序函数来实现这一目标。

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

who is the best?

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

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

Sample Output

1
3

Source

BestCoder Round #20

Recommend

heyang | We have carefully selected several similar problems for you: 5126 5125 5124 5122 5121

题意：判断谁是最好的人，也就是谁的票数最多。不过需要注意的是：如果票数一样多，则输出标号最小的那个。

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

using namespace std;

struct node
{
    int iu;
    int num;
};
node bj[10000];

bool cmp(node a,node b)
{
    if(a.num > b.num)
        return true;
    else if(a.num == b.num)
        return a.iu < b.iu;
    else
        return false;
}

int main()
{
    int n,t,i,j;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d",&t);
        memset(bj,0,sizeof(bj));
        int maxx = 0,num;
        for(i = 0;i < t;i++)
        {
            scanf("%d",&j);
            bj[j].iu = j;
            bj[j].num++;
        }
        sort(bj,bj+t,cmp);
        printf("%d\n",bj[0].iu);
    }
    return 0;
}