HDU 2602 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 gebone.
Output
One integer per line representing the maximum of the total value (this number will be less than 231).

思路
Sample Input
1（T一个例子）
5 10（N五个物品，V容量是10）
1 2 3 4 5（物品的价值）
5 4 3 2 1（物体的容量）
Sample Output
14
翻译一下题目大概就是每拿一个骨头，背包就会有相应的容量被占，在这个容量之下看最大能装多少价值的骨头。但是这里面值得注意的地方是会有0容量的样例存在…
因为这里面一个物体不能分割，所以这是01背包问题

PS：这也太死亡金属了，我可以

代码

//题目要求先输入价值.........
#include <stdio.h>
#include <string.h>