【hdu】 Bone Collector 01背包

包括01背包，完全背包，多重背包，二维费用背包，分组背包，以及混合背包

Bone Collector

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 23   Accepted Submission(s) : 14

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<cstdio>
#include<cstring>
using namespace std;
int max(int a,int b) {return a>b?a:b;}
int val[1005],c[1005],f[1005][1005];
int main()
{
    int T,N,V,i,j;
    scanf("%d",&T);
    while(T--)
    {
              scanf("%d%d",&N,&V);
              for(i=1;i<=N;i++)
                 scanf("%d",&val[i]);
              for(i=1;i<=N;i++)
                 scanf("%d",&c[i]);
              memset(f, 0, sizeof(f));  
              for(i=1;i<=N;i++)
                 for(j=0;j<=V;j++)
                 {
                      f[i][j]=f[i-1][j];
                      if(j>=c[i]) f[i][j]=max(f[i][j],f[i-1][j-c[i]]+val[i]);         
                 }
               printf("%d\n",f[N][V]);                  
              
    }
}