第5周YD督促训练 Ace of Aces
来源:互联网 发布:财富证券交易软件下载 编辑:程序博客网 时间:2024/06/05 17:07
Description
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 Ai 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 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
#include <iostream>#include<string.h>#include<algorithm>#include<cstdio>using namespace std;int main(){ int t,n,a[1001],max1,max11,max2,max22,x; cin>>t; while(t--) { memset(a,0,sizeof(a)); max11=max22=max1=max2=0; cin>>n; for(int i=0; i<n; i++) { cin>>x; a[x]++; } for(int i=0; i<1001; i++) { if(max1<a[i]) { max1=a[i]; max11=i; } if(max2<=a[i]) { max2=a[i]; max22=i; } } if(max11!=max22) cout<<"Nobody"<<endl; else cout<<max11<<endl; } return 0;}#include <iostream>#include<string.h>#include<algorithm>#include<cstdio>using namespace std;int main(){ int t,n,a[1001],max1,max11,max2,max22,x; cin>>t; while(t--) { memset(a,0,sizeof(a)); max11=max22=max1=max2=0; cin>>n; for(int i=0; i<n; i++) { cin>>x; a[x]++; } for(int i=0; i<1001; i++) ///顺序找到最大的下标 { if(max1<=a[i]) { max1=a[i]; max11=i; } } for(int i=1000; i>=0; i--) ///逆序找到最大的下标,而你提交错误就是因为i=1001超内存,哎,血淋淋的教训 if(max2<=a[i]) { max2=a[i]; max22=i; } if(max11!=max22) cout<<"Nobody"<<endl; else cout<<max11<<endl; } return 0;}
- 第5周YD督促训练 Ace of Aces
- YD 督促训练 lunch time(结构体)
- Ace of Aces
- ZOJ3869 Ace of Aces
- Ace of Aces
- Ace of Aces
- Ace of Aces
- Ace of Aces ZOJ
- Ace of Aces
- YD 督促训练 判断这年五一几天假期
- zoj 3869 Ace of Aces
- ZOJ 3869 Ace of Aces
- ZOJ-3869 Ace of Aces
- ACM-水题 Ace of Aces
- ZOJ 3869Ace of Aces
- ZOJ 3869-- Ace of Aces
- zoj-3869-Ace of Aces
- ZOJ3869:Ace of Aces(浙江省赛2015)
- 1219 骑士游历 解答
- Android BLE 扫描 通信
- 使用datagrateview控件时,显示数据库中表的信息
- CodeForces 16B Burglar and Matches
- CodeForces 15D Map
- 第5周YD督促训练 Ace of Aces
- 动态规划之To the Max
- 1、数据库启动与关闭相关(状态)
- #1049 : 后序遍历
- POJ2421 Constructing Roads(最小生成树)
- 排序算法
- Good-turning估计
- 女性程序员你需要注意
- 几款自带编码器的直流电机