Bone Collector

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

哈哈哈，这道题就是背包问题，重点在于把他的状态转移方程写出来l[j].z=max(l[j].z,l[j-l[i].y].z+l[i].x);第i个物品放入后，那么前i-1个物品可能会放入也可能因为剩余空间不够无法放入。对了，别忘记体积为0的情况。

//白书51页的背包题
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
    int x,y,z;
} l[101010];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int i,j,n,m;
        memset(l,0,sizeof(l));
        scanf("%d%d",&n,&m);
        for(i=1; i<=n; i++)
            scanf("%d",&l[i].x);
        for(i=1; i<=n; i++)
            scanf("%d",&l[i].y);
        for(i=1; i<=n; i++)
        {
            for(j=m; j>=0; j--)
            {
                if(j>=l[i].y)
                    l[j].z=max(l[j].z,l[j-l[i].y].z+l[i].x);
            }
        }
        printf("%d\n",l[m].z);
    }
    return 0;
}