zoj 3869 Ace of Aces
来源:互联网 发布:linux更换网卡 编辑:程序博客网 时间:2024/05/19 22:58
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 numberAi 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 containsN integers Ai (1 <=Ai <= 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
352 2 2 1 151 1 2 2 31998
Sample Output
2Nobody998
找出出现次数最多的数,若有多个输出nobody
#include<stdio.h>#include<string.h>#include<math.h>#include<stdlib.h>#include<queue>#include<stack>#include<algorithm>#define MAX 1000+1using 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;}
- zoj 3869 Ace of Aces
- ZOJ 3869 Ace of Aces
- ZOJ-3869 Ace of Aces
- ZOJ 3869Ace of Aces
- ZOJ 3869-- Ace of Aces
- zoj-3869-Ace of Aces
- Ace of Aces ZOJ
- ZOJ Problem Set - 3869||Ace of Aces
- ZOJ - 3869 Ace of Aces (水)
- ZOJ 3869-Ace of Aces【模拟众数】
- ZOJ 3869:Ace of Aces【水】
- zoj 3869 Ace of Aces (水题)
- A - Ace of Aces——ZOJ
- ZOJ 3869 Ace of Aces (The 12th Zhejiang Provincial Collegiate Programming Contest)
- Ace of Aces
- ZOJ3869 Ace of Aces
- Ace of Aces
- Ace of Aces
- 文章标题
- 安卓学习第十一天:抽象类,封装,包,访问权限
- Python命令行解析库argparse
- CSS加载外部字体以及字体格式转换
- UITabBar 和 UINavigationBar 样式的定制
- zoj 3869 Ace of Aces
- 我来说说操作系统中 死锁与饥饿的区别辨析
- 转载:2014 Top Security Tools as Voted by ToolsWatch.org Readers
- 作业1
- 多线程对比linkedList和arrayList的add方法
- 关于HashMap问题二
- 一个链式存储的例子(图片)
- 如何让两个div处于一行
- PHP源码分析-变量的存储方式