BestCoder Round #62 (div.2) HDOJ5562 Clarke and food(脑洞)
来源:互联网 发布:java wmf转jpg 编辑:程序博客网 时间:2024/06/05 10:21
Clarke and food
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 501 Accepted Submission(s): 292
Problem Description
Clarke is a patient with multiple personality disorder. One day, Clarke turned into a cook, was shopping for food.
Clarke has boughtn food. The volume of the i th food is vi . Now Clarke has a pack with volume V . He wants to carry food as much as possible. Tell him the maxmium number he can brought with this pack.
Clarke has bought
Input
The first line contains an integer T(1≤T≤10) , the number of the test cases.
For each test case:
The first line contains two integersn,V(1≤n≤105,1≤V≤109) .
The second line containsn integers, the i th integer denotes vi(1≤vi≤109) .
For each test case:
The first line contains two integers
The second line contains
Output
For each test case, print a line with an integer which denotes the answer.
Sample Input
13 51 3 4
Sample Output
2Hint: We can carry 1 and 3, the total volume of them is 5.
题目链接:点击打开链接
脑洞题, 本以为是背包, 读入数据后排序, 从小到大一直拿, 拿到不能拿为止可以使装食物数量最大.
AC代码:
#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"#include "utility"#include "map"#include "set"#include "vector"using namespace std;typedef long long ll;const int MAXN = 1e5 + 5;int n, v, a[MAXN];int main(int argc, char const *argv[]){ int t; scanf("%d", &t); while(t--) { scanf("%d%d", &n, &v); for(int i = 0; i < n; ++i) scanf("%d", &a[i]); sort(a, a + n); int sum = 0, ans = 0; for(int i = 0; i < n; ++i) { sum += a[i]; if(sum <= v) ans++; else break; } printf("%d\n", ans); } return 0;}
1 0
- BestCoder Round #62 (div.2) HDOJ5562 Clarke and food(脑洞)
- BestCoder Round #62 (div.2)-Clarke and food(模拟)
- BestCoder Round #62 (div.2) 1001 Clarke and food
- BestCoder Round #62 (div.2) HDU 5562 Clarke and food
- BestCoder Round #62 (div.2) Clarke and food
- HDU 5562 Clarke and food(排序)——BestCoder Round #62(div.2)
- BestCoder Round #62 (div.2)Clarke and food (简单贪心)
- BestCoder Round #62 (div.2) Clarke and five-pointed star
- BestCoder Round #62 (div.2) D.Clarke and baton
- hdu5463 Clarke and minecraft(BestCoder Round #56 (div.2) )
- BestCoder Round #56 (div.2)(Clarke and minecraft)
- BestCoder Round #56 (div.2)(Clarke and problem)
- BestCoder Round #56 (div.2) HDU5463 Clarke and minecraft
- hdu 5464 Clarke and problem (BestCoder Round #56 (div.2))
- BestCoder Round #56 (div.2) HDU5463 Clarke and minecraft
- BestCoder Round #72 (div.2) A.Clarke and chemistry
- BestCoder Round #72 (div.2) B.Clarke and points
- BestCoder Round #72 (div.2) Clarke and math
- 禁止查询关联ID
- ios开发--MD5加密
- 南方供暖
- qt相关界面 博客 很好
- OC内存管理
- BestCoder Round #62 (div.2) HDOJ5562 Clarke and food(脑洞)
- ios开放--objectForKey与valueForKey在NSDictionary中的差异
- java向mysql插入时间
- 用Leangoo做敏捷需求管理
- python——Tkinter的简单学习
- Memory Management Policy(内存管理政策)
- List排序
- Codeforces Round #331 (Div. 2) C. Wilbur and Points 贪心+排序
- 二维数组中查找是否存在某个值