NOJ-----1651二分
2016-07-28 10:24
253 查看
I - Red packet
Time Limit:1000MS Memory Limit:65535KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice NBUT
1651
Description
New Year is coming! Our big boss Wine93 will distribute some “Red Package”, just like Alipay and Wechat.
Wine93 has m yuan, he decides to distribute them to n people and everyone can get some money(0 yuan is not allowed and everyone’s money is an integer), Now k people has gotten money, it’s your turn to get “Red Package”, you want
to know, at least how much money to give you, then you can must become the “lucky man”. and the m yuan must be used out.
Noting that if someone’s money is strictly much than others’, than he is “lucky man”.
Input
Input starts with an integer T (T <= 50) denoting the number of test case.
For each test case, three integers n, m, k (1 <= k < n <= 100000, 0< m <= 100000000) will be given.
Next line contains k integers, denoting the money that k people get. You can assume that the k integers’ summation is no more than m.
Output
Ouput the least money that you need to become the “lucky man”, if it is impossible, output “Impossible” (no quote).
Sample Input
Sample Output
就是发红包,给出总钱数n,总人数m,已经k个已经拿到钱的人和他们拿到的钱,问把钱全分完,每个人最少拿1块钱,所有人拿到的钱都比这个人少,这个人最少拿多少钱
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int main(){
int s, e, m, m1, v, n, k, u, ans, last, cnt, t;
scanf("%d", &t);
while(t--){
scanf("%d%d%d", &n, &m1, &k);
ans = u = 0;
for(int i = 0; i < k; i++){
scanf("%d", &v);
u = u > v ? u : v;
ans += v;
}
s = u+1;//必须比前k个人拿钱最多的那个多
e = cnt = m1 - ans - n + k + 1;//剩下的每人先按1块钱算,除掉自己
if(u >= e){
printf("Impossible\n");
continue;
}
else{
while(s <= e){
m = (e+s) >> 1;
if(m <= cnt - m + 1){
s = m+1;
}
else{
e = m-1;
}
}
printf("%d\n", s);
}
}
return 0;
}
Time Limit:1000MS Memory Limit:65535KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice NBUT
1651
Description
New Year is coming! Our big boss Wine93 will distribute some “Red Package”, just like Alipay and Wechat.
Wine93 has m yuan, he decides to distribute them to n people and everyone can get some money(0 yuan is not allowed and everyone’s money is an integer), Now k people has gotten money, it’s your turn to get “Red Package”, you want
to know, at least how much money to give you, then you can must become the “lucky man”. and the m yuan must be used out.
Noting that if someone’s money is strictly much than others’, than he is “lucky man”.
Input
Input starts with an integer T (T <= 50) denoting the number of test case.
For each test case, three integers n, m, k (1 <= k < n <= 100000, 0< m <= 100000000) will be given.
Next line contains k integers, denoting the money that k people get. You can assume that the k integers’ summation is no more than m.
Output
Ouput the least money that you need to become the “lucky man”, if it is impossible, output “Impossible” (no quote).
Sample Input
3 3 5 2 2 1 4 10 2 2 3 4 15 2 3 5
Sample Output
Impossible 4 6
就是发红包,给出总钱数n,总人数m,已经k个已经拿到钱的人和他们拿到的钱,问把钱全分完,每个人最少拿1块钱,所有人拿到的钱都比这个人少,这个人最少拿多少钱
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int main(){
int s, e, m, m1, v, n, k, u, ans, last, cnt, t;
scanf("%d", &t);
while(t--){
scanf("%d%d%d", &n, &m1, &k);
ans = u = 0;
for(int i = 0; i < k; i++){
scanf("%d", &v);
u = u > v ? u : v;
ans += v;
}
s = u+1;//必须比前k个人拿钱最多的那个多
e = cnt = m1 - ans - n + k + 1;//剩下的每人先按1块钱算,除掉自己
if(u >= e){
printf("Impossible\n");
continue;
}
else{
while(s <= e){
m = (e+s) >> 1;
if(m <= cnt - m + 1){
s = m+1;
}
else{
e = m-1;
}
}
printf("%d\n", s);
}
}
return 0;
}
相关文章推荐
- Dubbo入门第一例
- 剑指Offer——数组的整数次方pow
- tomcat宕机自动重启和每日定时启动tomcat【工具包系列】
- Development cannot be enabled while your device is locked.
- 关于view的Touch事件的一些理解
- U_boot 的 bootcmd 和bootargs参数详解
- 级联下拉菜单的实现
- App Thinning研究
- sql查询数据库表中重复记录方法
- Android 使用MediaStore.Images和 Cursor查询本地图片和图片缩略图
- MySQL 5.7并行复制时代
- tyvj 1059 过河 dp
- Mysql行号
- Perl参考函数
- POJ - 3311 Hie with the Pie
- VS2008快捷键总结
- UIScrollView的循环滚动+UIPageControll
- UVA 11149 Power of Matrix(矩阵+二分)
- Android开发笔记(-)初识Android中的px,sp,dp
- GitHub相关