杭电 2602 bone collector （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
  
  
  
  

   
    
  
  
  
  

   
    
  
  
  
  

   
   由于没有读题一直以为第三行是重量第四行是价值结果你懂得 折腾我几个小时fuck
  
  
  
  

   
   01背包模板
  
  
  
  

   
   AC代码：
  
  
  
  

   
   
#include<stdio.h>
#include<string.h>
//#define max(a,b) a>b?a:b
#include<algorithm>
using namespace std;
int main()
{
	int f[10100];
	int bag[10100];
	int val[10100];
	int t,i,j,n,v;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&v);
		memset(f,0,sizeof(f));
		memset(bag,0,sizeof(bag));
		memset(val,0,sizeof(val));
		for(i=1;i<=n;i++)
		scanf("%d",&val[i]);//价值 
		for(i=1;i<=n;i++)
		scanf("%d",&bag[i]);//重量 
		for(i=1;i<=n;i++)
		{
			for(j=v;j>=bag[i];j--)
			{
				f[j]=max(f[j],f[j-bag[i]]+val[i]);//01背包优化为数组 
			}
		} 
		printf("%d\n",f[v]);
	}
	return 0;
}