MYF

HDU 5123 who is the best?

Posted on | In | | Visitors

题目链接

HDU 5123

题目类型：水题

题目来源：BestCoder Round #20

题目分析

题目大意

给出$n$个人的投票情况，问谁的票数最多，输出编号较小的那个

解析

标记，然后遍历即可。

代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <iomanip>
#include <bitset>
#include <cstring>
#include <iostream>
#include <deque>
#include <algorithm>
#define Memset(a,val) memset(a,val,sizeof(a))
#define PI acos(-1)
#define PB push_back
#define MP make_pair
#define rt(n)       (i == n ? '\n' : ' ')
#define hi         printf("Hi----------\n")
#define IN freopen("input.txt","r",stdin);
#define OUT freopen("output.txt","w",stdout);
#define debug(x) cout<<"Debug : ---"<<x<<"---"<<endl;
#define debug2(x,y) cout<<"Debug : ---"<<x<<" , "<<y<<"---"<<endl;
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
typedef pair<int,int> PII;
typedef long long ll;
const int mod=110119;
const int INF=0x3f3f3f3f;
const double eps=1e-8;
int main(){
    int t;
    scanf("%d",&t);
    while (t--) {
        int vis[105]={};
        int n,tmp;
        cin>>n;
        while (n--) {
            scanf("%d",&tmp);
            vis[tmp]++;
        }
        int mx=-1,pos;
        for (int i=1; i<=100; i++) {
            if (vis[i]>mx) {
                mx =vis[i];
                pos = i;
            }
        }
        printf("%d\n",pos);
    }
}