Bone Collector - HDU 2602 01背包

Bone Collector

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

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
  
  

 

题意：就是01背包，没什么好说的。

AC代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[1010],value[1010],volume[1010];
int main()
{ int t,n,m,i,j,k,ans;
  scanf("%d",&t);
  while(t--)
  { scanf("%d%d",&n,&m);
    memset(dp,0,sizeof(dp));
    for(i=1;i<=n;i++)
     scanf("%d",&value[i]);
    for(i=1;i<=n;i++)
     scanf("%d",&volume[i]);
    for(i=1;i<=n;i++)
     for(j=m;j>=volume[i];j--)
      dp[j]=max(dp[j],dp[j-volume[i]]+value[i]);
    ans=0;
    for(i=1;i<=m;i++)
     ans=max(ans,dp[i]);
    printf("%d\n",ans);
  }
}