hdu 2602Bone Collector

Bone Collector

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 39796    Accepted Submission(s): 16500

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
  
  

 

题意：给你n种类型的骨头，给你v金额，求能得到最多的价值。

简单的01背包做

package hdu;

import java.util.Scanner;

public class p2602 {

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int t=sc.nextInt();
		while(t-->0){
			int n=sc.nextInt();
			int v=sc.nextInt();
			int volume[]=new int[n];
			int value[]=new int[n];
			for(int i=0;i<n;i++ ){
				volume[i]=sc.nextInt();
			}
			for(int i=0;i<n;i++){
				value[i]=sc.nextInt();
			}
			int f[]=new int[v+1];
			for(int i=0;i<n;i++){
				for(int j=v;j>=value[i];j--){
					f[j]=Math.max(f[j-value[i]]+volume[i], f[j]);
				}
			}
			System.out.println(f[v]);
		}
	}

}