Bone Collector 【简单dp】[java]

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
  
  

很简单的动态规划题:题目大意，n代表骨头数。V代表背包体积。首先一行说明每一个骨头的价值，再一行说明体积

a【j】=(a[j],a[j-v[i]]+value[i]);

public static void main(String args[]){
	
	Scanner scan=new Scanner(System.in);
	int num=scan.nextInt();
	while(num-->0){
	int bones=scan.nextInt();
	int volume=scan.nextInt();
	
	int value[]=new int[bones]; 
	int v[]=new int[bones];
	int aux[]=new int[volume+1];
	
	for(int i=0;i<bones;i++){
		
		value[i]=scan.nextInt();
		
	}
	
	for(int i=0;i<bones;i++){
		
		v[i]=scan.nextInt();
		
	}
	
	for(int i=0;i<value.length;i++){
		for(int j=volume;j>=0;j--){
		
			if(j-v[i]>=0)
			aux[j]=Math.max(aux[j], aux[j-v[i]]+value[i]);
			
		}
		
	}
	System.out.println(aux[aux.length-1]);
	
	}
}