Bone Collector（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³¹).

 

Sample Input

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

 

Sample Output

14

0-1背包
一.滚动一维数组
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <list> 
#include <map> 
#include <string>
using namespace std; 
#define infinity 2147483647
 
int dp[10005],v[10005],w[10005]; 
int maxx(int a,int b)
{
	if(a>b)
		return a;
	else
		return b;
}
int main()
{
	int n,i,j,m,t;
	
	while(scanf("%d",&t)!=EOF)
	{
		while(t--)
		{
			scanf("%d %d",&n,&m);
				
			for(i=1;i<=n;i++)
			scanf("%d",&w[i]);
			for(i=1;i<=n;i++)
			scanf("%d",&v[i]);
			memset(dp,0,sizeof(dp));
			
			for(i=1;i<=n;i++)
			{
				for(j=m;j>=v[i];j--)       //必须反举
				{
					dp[j]=maxx(dp[j],dp[j-v[i]]+w[i]);
				}
			}
			printf("%d\n",dp[m]);		
		}
	}
		
	return 0;
}
二.二维数组
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <list> 
#include <map> 
#include <string>
using namespace std; 
#define infinity 2147483647
  
int maxx(int a,int b)
{
	if(a>b)
		return a;
	else
		return b;
}
int f[10005][10005],v[10005],w[10005]; 
int main()
{
	int n,i,j,m,t;
	
	while(scanf("%d",&t)!=EOF)
	{
		while(t--)
		{
			scanf("%d %d",&n,&m);
				
			for(i=1;i<=n;i++)
			scanf("%d",&w[i]);
			for(i=1;i<=n;i++)
			scanf("%d",&v[i]);
						
			for(j=0;j<=m;j++)
			{
				f[0][j]=0;	
			}		
			for(i=1;i<=n;i++)
			{		
				for(j=0;j<=m;j++)
				{
					f[i][j]=f[i-1][j];
					if(v[i]<=j)
					{
						f[i][j]=maxx(f[i][j],f[i-1][j-v[i]]+w[i]);
					}			
				}
			}
			printf("%d\n",f[n][m]);						
		}
	}
		
	return 0;
}