TORONTO KIDS COMPUTER CLUB | Aurora Saturday 14:30 Python Practice 22.09.03.
21024
post-template-default,single,single-post,postid-21024,single-format-standard,ajax_fade,page_not_loaded,,qode-theme-ver-7.6.2,wpb-js-composer js-comp-ver-6.8.0,vc_responsive

Aurora Saturday 14:30 Python Practice 22.09.03.

07 Sep Aurora Saturday 14:30 Python Practice 22.09.03.

Question: 

Many years ago, in Jack’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
1
5 10
1 2 3 4 5
5 4 3 2 1

Sample Output
14

No Comments

Sorry, the comment form is closed at this time.