DP Problem P：Bone Collector（HDU 2602

Problem P

Time Limit : 2000/1000ms (Java/Other)   Memory Limit :32768/32768K (Java/Other)

Total Submission(s) : 1   Accepted Submission(s) : 1

Problem Description

Many years ago , in Teddy’shometown there was a man who was called “Bone Collector”. This man like tocollect varies of bones , such as dog’s , cow’s , also he went to the grave…<br>The bone collector had a big bag with a volume of V ,and along histrip of collecting there are a lot of bones , obviously , different bone hasdifferent value and different volume, now given the each bone’s value along histrip , can you calculate out the maximum of the total value the bone collectorcan get ?<br><center><img src=../../../data/images/C154-1003-1.jpg></center><br>

Input

The first line contain ainteger T , the number of cases.<br>Followed by T cases , each case threelines , 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 secondline contain N integers representing the value of each bone. The third linecontain N integers representing the volume of each bone.

Output

One integer per linerepresenting the maximum of the total value (this number will be less than2³¹).

Sample Input

1

5 10

1 2 3 4 5

5 4 3 2 1

Sample Output

14

 算法分析：

简单01背包问题

代码实现：