###### 01背包 HDU2602

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<iostream>
#include<stdio.h>
#include<memory.h>
using namespace std;
int mon[1003],w[1003];
int f[1001]={0};
int max(int x,int y)
{
if(x>y)
return x;
else
return y;
}
int main()
{
int n,v,i,j,k;
int t;
cin>>t;
for( k=0;k<t;k++)
{
memset(f,0,sizeof(f));
cin>>n>>v;
for(i=0;i<n;i++)
{
cin>>mon[i];
}
for(i=0;i<n;i++)
{
cin>>w[i];
}
//for(i=0;i<n;i++)
// {
//         cout<<mon[i]<<w[i];
// }
for(i=0;i<n;i++)
{
for(j=v;j>=w[i];j--)
{
f[j]=max(f[j],f[j-w[i]]+mon[i]);
//cout<<f[v]<<endl;
}
}
cout<<f[v]<<endl;
}
/*for(i=0;i<t;i++)
{
cout<<a[i]<<endl;
}*/
return 0;
}


#### Python第二章包入门实战

2017年12月15日 14:21

#### 01背包的理解，二维数组化一维数组的理解（附hdu2602 Bone Collector）

2016-07-30 16:41:00

#### hdu2602 Bone Collector (01背包）

2014-05-02 16:36:37

#### 用记忆化搜索的方法做01背包题

2015-10-16 16:48:59

#### HDU 2602 Bone Collector【01背包入门题】

2016-09-20 17:28:47

#### HDU2602/HDU1114/HDU2191(重新整理一下01背包，完全背包，多重背包)

2017-01-11 13:24:03

#### HDU2602(01背包）

2017-05-23 14:39:55

#### hdu2602 01背包

2015-01-11 17:17:48

#### HDU2602 01背包

2017-08-15 09:39:16

#### 01背包 HDU2602

2014-02-12 13:27:30

01背包 HDU2602