Ace of Aces
来源:互联网 发布:android登录注册源码 编辑:程序博客网 时间:2024/05/29 13:20
Ace of Aces
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
Think:记录每一个数据出现的次数,如果出现次数最多的不唯一就输出Nobody,否则输出最多的出现次数最多的数
#include <stdio.h>#include <string.h>#include <stdlib.h>typedef struct{ int a, c;}X;int cmp(const void *a, const void *b){ return (*(X *)b).c > (*(X *)a).c;}int main(void){ int t, n; X x[1123]; scanf("%d", &t); while (t--) { memset(x, 0, sizeof(x)); for (int i = 0; i < 1001; i++) x[i].a = i; scanf("%d", &n); while (n--) { int a; scanf("%d", &a); x[a].c++; } qsort(x, 1001, sizeof(X), cmp); if (x[0].c > x[1].c) printf("%d\n", x[0].a); else printf("Nobody\n"); }}
0 0
- Ace of Aces
- ZOJ3869 Ace of Aces
- Ace of Aces
- Ace of Aces
- Ace of Aces
- Ace of Aces ZOJ
- Ace of Aces
- 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)
- 浙江省赛 2015 -> A.Ace of Aces
- ZOJ Problem Set - 3869||Ace of Aces
- ZOJ - 3869 Ace of Aces (水)
- 遍历json对象转成map
- 关于用奇酷360手机调试apk时不能在logcat输出的问题
- Xcode8使用出现bundleid: com.jd.***, enable_level: 0, persist_level: 0, propagate_with_acti
- 串口、COM口、TTL、RS-232,RS-485的区别详解
- Android之Handler的用法
- Ace of Aces
- Android探索之旅(第十三篇)Android开发人员不得不知道的小工具(持续收录中......)
- DAOFactory复用代码
- NO.96 Hudson+Sonar+Sonarrunner JVM配置点
- linux expect详解(ssh自动登录)
- jquery和Js的区别和基础操作
- oracle dg修改联机日志logfile路径以及大小
- URAL-1584-Pharaohs’ Secrets【二分图最佳匹配】【好题】
- estIntraPredLumaQT函数