Bone Collector
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 24 Accepted Submission(s) : 9
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 ¡<br>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 ?<br><center><img src=../../../data/images/C154-1003-1.jpg> </center><br>
Input
The first line contain a integer T , the number of cases.<br>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 2<sup>31</sup>).
Sample Input
1<br>5 10<br>1 2 3 4 5<br>5 4 3 2 1
Sample Output
14
Author
Teddy
Source
HDU 1st ¡°Vegetable-Birds Cup¡± Programming Open Contest