杭电OJ 2602 典型01背包问题

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

 

Sample Input

  
  

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

 

Sample Output

  
  

   
   14
  
  

我的代码：

#include <iostream>
using namespace std;



int Max(int A,int B)
{
	return A>B?A:B;
}
int main()
{
	int T;
	//scanf("%d",&T);
	cin>>T;
	int bone;
	int bag;
	int weight[1000];
	int value[1000];
	int dp[1000];
	while(T--)
	{
		memset(dp,0,sizeof(dp));
		cin>>bone>>bag;
		/*scanf("%d",&bone);
		scanf("%d",&bag);*/
		for(int i=0;i<bone;i++)
		{
			cin>>value[i];
		}
		for(int i=0;i<bone;i++)
		{
			cin>>weight[i];
		}
		if(bag==0||bone==0)
		{
			cout<<'0'<<endl;
			continue;
		}
		for(int i=0;i<bone;i++)
		{
			for(int j=bag;j>=weight[i];j--)
			{
				dp[j]=Max(dp[j],dp[j-weight[i]]+value[i]);
			}
		}
		cout<<dp[bag]<<endl;
	}
}