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 bone.
Output
One integer per line representing the maximum of the total value (this number will be less than 2
31).
Sample Input
1
5 10
1 2 3 4 5
5 4 3 2 1
Sample Output
14
Author
Teddy
Source
HDU 1st “Vegetable-Birds Cup” Programming Open Contest
Recommend
lcy | We have carefully selected several similar problems for you: 1203 2159 2955 1171 2191
#include<stdio.h> #include<string.h> #include<math.h> #include<algorithm> using namespace std; int main() { int t; scanf("%d",&t); while(t--) { int n,m; int a[1005],b[1005],k[1005]; scanf("%d%d",&n,&m); int i,j; for(i=0;i<n;i++) { scanf("%d",&a[i]); } for(int i=0;i<n;i++) { scanf("%d",&b[i]); } memset(k,0,sizeof(k)); for(i=0;i<n;i++) { for(j=m;j>=b[i];j--) { k[j]=max(k[j],(k[j-b[i]]+a[i])); } } printf("%d\n",k[m]); } return 0; }
转载请注明原文地址: https://ju.6miu.com/read-1302974.html