Bone Collector(01背包模板题）

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 <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int main()
{
int t,n,v,i[1005],j[1005],dp[1005];
scanf("%d",&t);
while(t --)
{
scanf("%d%d",&n,&v);
memset(dp,0,sizeof(dp));
for(int a = 0; a < n; a ++)
scanf("%d",&j[a]);
for(int a = 0; a < n; a ++)
scanf("%d",&i[a]);
for(int a = 0; a < n; a ++)
{
for(int b = v; b >= i[a]; b --)
dp[b]=max(dp[b],dp[b-i[a]]+j[a]);
}
for(int a = 0; a <= v; a ++)
dp[0]=max(dp[0],dp[a]);
printf("%d\n",dp[0]);
}
return 0;
}