BestCoder Round #62 (div.2) HDU 5562 Clarke and food
2015-11-14 23:32
411 查看
Clarke and food
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536K (Java/Others)
Total Submission(s): 216 Accepted Submission(s): 123
Problem Description
Clarke is a patient with multiple personality disorder. One day, Clarke turned into a cook, was shopping for food.
Clarke has bought n food.
The volume of the ith
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.
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 integers n,V(1≤n≤105,1≤V≤109).
The second line contains n integers,
the ith
integer denotes vi(1≤vi≤109).
Output
For each test case, print a line with an integer which denotes the answer.
Sample Input
1 3 5 1 3 4
Sample Output
2 Hint: We can carry 1 and 3, the total volume of them is 5.
Source
BestCoder Round #62 (div.2)
出题人:
可以证明从小到大一直拿,拿到不能拿为止是最优的。
所以排序一下即可。
相关文章推荐
- WCF利用Stream上传大文件
- 亲手教你搭建windows2008虚拟机
- iOS 开发之带输入框的UIAlertView
- 2015第46周六
- innerText(ie) textContent(FF) 兼容
- 定义化标签之文本元素
- XShell连接VirtualBox下的Linux虚拟机
- JAVA设计模式(23) —<行为型>解释器模式(Interpreter)
- mysql基本问题2
- Android图片旋转,缩放,位移,倾斜,对称完整示例(一)——imageView.setImageMatrix(matrix)和Matrix
- wget命令---Linux学习笔记
- 搭建maven+spring+freemaker+mybatis环境之三
- Javascript全选、反选、全不选功能
- [AngularJS] Use ng-model-options to limit $digest
- 接收post数据的形式
- Facebook开源项目汇总
- hdu 1829 A Bug's Life(并查集+偏移向量)
- css3在线生成器
- WPF自定义空心文字
- 列表生成式