hdu 2602 Bone Collector ( 01背包)

Bone Collector

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

Total Submission(s) : 5   Accepted Submission(s) : 4

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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 231).

Sample Input

1
5 10
1 2 3 4 5
5 4 3 2 1

Sample Output

14

 

思路：简单的01背包

 

代码：

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
int f[1005][1005];
using namespace std;
int main()
{
    int t,m,n,a[1005],b[1005];
    cin>>t;
    while(t--)
    {
        cin>>m>>n;
        int i,j;
        for(i=1;i<=m;i++)
        {
            cin>>a[i];
        }
        for(i=1;i<=m;i++)
        {
            cin>>b[i];
        }
        memset(f,0,sizeof(f));
        for(i=1;i<=m;i++)
        {
            for(j=n;j>=0;j--)
            {
                if(j<b[i])
                {
                    f[i][j]=f[i-1][j];
                }
                else
                {
                    f[i][j]=max(f[i-1][j],f[i-1][j-b[i]]+a[i]);
                }
            }
        }
        cout<<f[m][n]<<endl;
    }
    return 0;
}