Bone Collector

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).

SampleInput

1
5 10
1 2 3 4 5
5 4 3 2 1

SampleOutput

14

#include <iostream>
#include <string.h> 
using namespace std;

int max(int x,int y){
    return x>y?x:y;
}

int main()
{
    int T;
    cin>>T;
    int v[1010],w[1010],f[1010];    
    while(T--){
        int N,V,i;
        cin>>N>>V;
        memset(v,0,sizeof(v));
        memset(w,0,sizeof(w));
        memset(f,0,sizeof(f));
        for(i=1;i<=N;i++)
            cin>>w[i];
        for(i=1;i<=N;i++)
            cin>>v[i];
        for(i=1;i<=N;i++)
            for(int j=V;j>=v[i];j--){

                f[j]=max(f[j],f[j-v[i]]+w[i]);

            }
        cout<<f[V]<<endl;
    }
    return 0;
}