HDU2602Bone Collector（01背包）

Bone Collector

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背包。

附AC代码。

#include 
   
   
    
    
#include 
    
    
     
     
using namespace std;

struct node {
  int c, v;
};

node s[1001];

int main(int argc, const char * argv[]) {
  int T;
  cin >> T;
  int N, V;
  int val[1001];
  while (T--) {
    cin >> N >> V;
    for (int i = 0; i < N; i++)
      cin >> s[i].v;
    for (int i = 0; i < N; i++)
      cin >> s[i].c;
    memset(val , 0 , sizeof(val));
    for (int i = 0; i < N; i++)
      for (int j = V; j >= s[i].c; j--)
        val[j] = max(val[j] , val[j - s[i].c] + s[i].v);
    cout << val[V] << endl;
  }
  return 0;
}