HDU2602Bone Collector(01背包)
来源:互联网 发布:linux 发送icmp请求包 编辑:程序博客网 时间:2024/04/19 04:48
Bone Collector
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
15 101 2 3 4 55 4 3 2 1
Sample Output
14
题目大意:一个***的人,喜欢收集各种奇奇怪怪的骨头,每个骨头有自己的价值和大小,现有N种大小、价值同的骨头,他有一个容量为V的包,问:他一次最多能够带走价值多少的骨头。
思路:典型的01背包。
附AC代码。
0 0
- hdu2602Bone Collector(01背包)
- HDU2602Bone Collector(01背包)
- HDU2602Bone Collector(01背包)
- hdu2602Bone Collector(01背包)
- hdu2602Bone Collector(DP---01背包)
- hdu2602Bone Collector (简箪01背包)
- HDU2602Bone Collector 0-1背包问题
- HDU2602Bone Collector
- HDU2602Bone Collector
- hdu2602Bone Collector(动态规划)
- hdu2602Bone Collector && POJ3624Charm Bracelet
- Bone Collector(01背包)
- Bone Collector(01背包)
- Bone Collector(01背包)
- Bone Collector(01背包)
- Bone Collector(01背包)
- 01背包(Bone Collector)
- Bone Collector(01背包)
- HTML JavaScript 基础 (下)
- java解析String字符串xml 多级节点NodeList
- CentOS7.2 在GUI下关闭X Server
- Linux系统概念与体系(待修改)
- 对于一些经典库函数的源代码认识以及分析1.
- HDU2602Bone Collector(01背包)
- mysql多表联查
- navbar的一些坑
- C和Java中static修饰符的作用
- 如何查看Google官方文档
- 重写向&转发
- 初识指针
- 浅谈Java内存管理(二)
- Java的静态/动态绑定