HDU 2602

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[sup]31[/sup]).

Sample Input

1

5 10

1 2 3 4 5

5 4 3 2 1

Sample Output

14

01背包

代码：

#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
    int dp[1010],i,j,a[1010],b[1010],t,m,n;
    cin>>t;
    while(t--)//测试数据
    {
        cin>>n>>m;
        for(i=1;i<=n;i++)
            cin>>a[i];//输入价值
        for(i=1;i<=n;i++)
            cin>>b[i];//输入体积
        memset(dp,0,sizeof(dp));
        for(i=1;i<=n;i++)
        {
            for(j=m;j>=b[i];j--)
            {
                dp[j]=max(dp[j],a[i]+dp[j-b[i]]);
            }
        }
        cout<<dp[m]<<endl;//01背包核心代码
    }
    return 0;
}