|
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) 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 … 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. 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
Sample Output
14 翻译:有一人爱收集骨头,每个骨头有一个价值和重量,他有一个背包,容量为V,问他装得最大价值量是多少?(经典的01背包问题)
重点:01背包、动态规划 难点:动态方程的书写
|