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 …
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
#include<stdio.h>
#include<string.h>
int max(int x,int y)
{return x>y?x:y;}
int value[1001],volume[1001],f[1001];
int main()
{
int t,n,v;
int i,j;
while(scanf("%d",&t)!=EOF)
{
while(t--)
{
memset(f,0,sizeof(f));
scanf("%d %d",&n,&v);
for(i=0;i<n;i++)
scanf("%d",&value[i]);
for(i=0;i<n;i++)
scanf("%d",&volume[i]);
for(i=0;i<n;i++)
for(j=v;j>=volume[i];j--)
f[j]=max(f[j],f[j-volume[i]]+value[i]);
printf("%d\n",f[v]);
}
}
}