L

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 2 ³¹).

Sample Input

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

Sample Output

14
第一次一写就过的背包题，简单的01背包。

#include <cstring>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
#define maxN 10500
typedef long long LL;
int m[maxN],v[maxN],dp[maxN];
int N,V;
int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d%d",&N,&V);
        for(int i=1;i<=N;i++)
            scanf("%d",&m[i]);
        for(int i=1;i<=N;i++)
            scanf("%d",&v[i]);

        memset(dp,0,sizeof(dp));

        for(int i=1;i<=N;i++)
            for(int j = V;j >= v[i];j--)
        {
            dp[j] = max(dp[j],dp[j-v[i]]+m[i]);
        }

        printf("%d
",dp[V]);

    }
    return 0;
}