HDU 5364
来源:互联网 发布:网络恐怖主义解释 编辑:程序博客网 时间:2024/04/30 00:16
Distribution money
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 310 Accepted Submission(s): 186
Problem Description
AFA want to distribution her money to somebody.She divide her money into n same parts.One who want to get the money can get more than one part.But if one man's money is more than the sum of all others'.He shoule be punished.Each one who get a part of money would write down his ID on that part.
Input
There are multiply cases.
For each case,there is a single integer n(1<=n<=1000) in first line.
In second line,there are n integer a1,a2...an(0<=ai<10000)ai is the the ith man's ID.
Output
Output ID of the man who should be punished.
If nobody should be punished,output -1.
Sample Input
3
1 1 2
4
2 1 4 3
Sample Output
1
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 310 Accepted Submission(s): 186
Problem Description
AFA want to distribution her money to somebody.She divide her money into n same parts.One who want to get the money can get more than one part.But if one man's money is more than the sum of all others'.He shoule be punished.Each one who get a part of money would write down his ID on that part.
Input
There are multiply cases.
For each case,there is a single integer n(1<=n<=1000) in first line.
In second line,there are n integer a1,a2...an(0<=ai<10000)ai is the the ith man's ID.
Output
Output ID of the man who should be punished.
If nobody should be punished,output -1.
Sample Input
3
1 1 2
4
2 1 4 3
Sample Output
1
-1
#include <stdio.h>#include <string.h>int a[1010];int b[10010];int main(){ int n; while(~scanf("%d",&n)) { int c,temp=0; int ans=0; memset(b,0,sizeof(b)); for(int i=0;i<n;i++) { scanf("%d",&c); b[c]++; if(b[c]>temp) { temp=b[c]; ans=c; } } if(temp>n-temp) printf("%d\n",ans); else printf("-1\n"); } return 0;}
0 0
- HDU 5364
- hdu 5364 Distribution money
- hdu 5364 简单模拟
- hdu 5364 Distribution money
- HDU 5364 Distribution money
- hdu 5364 Distribution money
- HDU 5364 5366
- HDU 5364 Distribution money
- HDU 5364 Distribution money
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- Android系统UI设计之:视图
- PAT A 1002. A+B for Polynomials
- android 网络框架Android_Async_Http 初识
- Java基础学习总结---------异常Exception(3) -JVM默认如何处理异常
- Android数据存储结构
- HDU 5364
- 指针和动态内存
- 普通型母函数模板理解
- hdu 2874 lca-tarjan离线算法(模板)
- 第一周工作周报-5
- Java文件删除问题
- java使用dbcp操作数据库的用法
- HDU 5366
- HDU-2871 Flood-it!(IDA*)