01背包-HDOJ2602-Bone Collector
2015-09-23 19:44
295 查看
Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 40794 Accepted Submission(s): 16961
Problem Description
Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …
The bone collector had a big bag with a volume of V ,and along his trip of collecting there are a lot of bones , obviously , different bone has different value and different volume, now given the each bone’s value along his trip , can you calculate out the
maximum of the total value the bone collector can get ?
Input
The first line contain a integer T , the number of cases.
Followed by T cases , each case three lines , the first line contain two integer N , V, (N <= 1000 , V <= 1000 )representing the number of bones and the volume of his bag. And the second line contain N integers representing the value of each bone. The third
line contain N integers representing the volume of each bone.
Output
One integer per line representing the maximum of the total value (this number will be less than 231).
Sample Input
1 5 10 1 2 3 4 5 5 4 3 2 1
Sample Output
14
题目大意:标标准准的01背包。
代码:
相关文章推荐
- MVC中@Html.Partial,@Html.Action,@Html.RenderPartial,@Html.RenderAction区别
- Apache+PHP+Mysql 配置
- jquery中如何退出each循环
- JAVA WEB 总结 Servlet篇
- LeetCode (54) Valid Anagram
- sicily 1021 couples
- Codeforces Round #321 Kefa and Watch(字符串哈希+线段树)
- 面试相关之链表
- linux 命令 system () 函数详解
- 0923《操作系统教程》实验一 ·DOS命令解释程序的编写
- CoreLocation框架定位详解
- HDU 5120 Intersection(几何模板题)
- 欢迎使用CSDN-markdown编辑器
- UVa 1586 - Molar mass
- 注意身体
- SignalTap Ⅱ使用步骤整理
- 使用JBoss 5.1.0.GA部署项目可能遇到的问题汇总
- zoj3829 Known Notation --- 2014 ACM-ICPC Asia Mudanjiang Regional Contest
- Linux 磁阵性能瓶颈定位过程
- javascript模拟getElementByClassName