HDU 5364 Distribution money
2016-03-27 13:30
281 查看
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.
sample input
3
1 1 2
4
2 1 4 3
sample output
1
-1
题意
地主给排着队的长工发工资,每份工资是一样的,领了工资的人会留下工号,但是有的人对领完之后回到队尾再领,如果有人领的工资比其他所有人只和还多,试求是否有这样的人以及他的编号。
题解
题意也就是寻找序列中出现次数超过一半的元素,可以先排序,然后计算中间位置元素的数量(二分),超过一半就是答案,小于一半则无解
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.
sample input
3
1 1 2
4
2 1 4 3
sample output
1
-1
题意
地主给排着队的长工发工资,每份工资是一样的,领了工资的人会留下工号,但是有的人对领完之后回到队尾再领,如果有人领的工资比其他所有人只和还多,试求是否有这样的人以及他的编号。
题解
题意也就是寻找序列中出现次数超过一半的元素,可以先排序,然后计算中间位置元素的数量(二分),超过一半就是答案,小于一半则无解
#include<stdio.h> #include<iostream> #include<algorithm> using namespace std; int a[1002]; int main(void) { //freopen ("in.txt","r",stdin); int n,k; while (scanf("%d",&n)!=EOF) { for (int i=1;i<=n;++i) scanf("%d",&a[i]); sort(a+1,a+1+n); k=a[(1+n)/2]; if (upper_bound(a+1,a+1+n,k)-lower_bound(a+1,a+1+n,k)>n/2) printf("%d\n",k); else printf("-1\n"); } }
相关文章推荐
- MVC过滤器详解
- 欢迎使用CSDN-markdown编辑器
- 【总结】2015年总结 2016年计划
- 福克斯保养明细
- Android Studio 本机调试
- 数据库批量修改表名,增加前缀(SQL server)
- css优先级及权重值
- 制作jar文件
- 编程书籍
- 【BZOJ1006】【HNOI2008】神奇的国度
- 《Linux内核分析与实现》 第四周 读书笔记
- hibernate @mappedBy小记
- PHP string
- BZOJ 1199: [HNOI2005]汤姆的游戏
- Android Studio动态调试Smali
- Collection--Set--hashSet
- ERROR: JDWP Unable to get JNI 1.2 environment, jvm->GetEnv() return code = -2
- 深度懵逼计算机系统。。。DataLab。。
- Uva 12663 High bridge, low bridge 离散化
- 分析system_call中断处理过程