Bone Collector

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
   
   

   
   

  
  

 

Author

Teddy

 

Source

HDU 1st “Vegetable-Birds Cup” Programming Open Contest

 

Recommend

lcy

#include<stdio.h>
struct bone
{
	int vol;
	int val;
}bon[1010];

int max(int a,int b)
{
	return a>b?a:b;
}
int main()
{
	int t,n,v,i,j,f[1010];
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&v);
		for(i=0;i<n;i++)
			scanf("%d",&bon[i].val);
		for(i=0;i<n;i++)
			scanf("%d",&bon[i].vol);
		for(i=0;i<=v;i++)
			f[i]=0;
		for(i=0;i<n;i++)
		{
			for(j=v;j>=bon[i].vol;j--)
				f[j]=max(f[j],f[j-bon[i].vol]+bon[i].val);
		}
		printf("%d\n",f[v]);
	}
	return 0;
}