hdu 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
  
  
  
  

   
    
  
  
  
  

   
    
  
  
  
  

   
   代码：
  
  
  
  

   
   #include<stdio.h>
#include<string.h>
#define max(a,b) a>b?a:b
int v[1100];
int w[1100];
int f[1100];
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n,m;
        scanf("%d %d",&n,&m);
        int i,j,k;
        memset(f,0,sizeof(f));
        for(i=1;i<=n;i++)
        scanf("%d",&w[i]);
        for(i=1;i<=n;i++)
        scanf("%d",&v[i]);

   
           for(i=1;i<=n;i++)
        for(j=m;j>=v[i];j--)
        {
            f[j]=max(f[j],f[j-v[i]]+w[i]);//当背包剩余的体积大于ith的体积时，执行；判断第ith个重物是否放入背包
        }
        printf("%d\n",f[m]);

    }
    return 0;}