HDU-2602-Bone Collector

   

Bone Collector

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 87918    Accepted Submission(s): 36253
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

Author

Teddy

Source

HDU 1st “Vegetable-Birds Cup” Programming Open Contest

Recommend

lcy   |   We have carefully selected several similar problems for you:  2159 2955 1171 2844 2084 

 Statistic | Submit | Discuss | Note

#include<stdio.h>
int f[1100][1100];
int max(int a,int b)
{
    if(a>=b)
        return a;
    else
        return b;
}
int bag(int n,int v)
{
    int i,j;
    int w[1100];
    int c[1100];
    for(i=1; i<=n; i++)
    {
        scanf("%d",&c[i]);
    }
    for(i=1; i<=n; i++)
    {
        scanf("%d",&w[i]);
    }
    for(i=1; i<=n; i++)
    {
        for(j=0; j<=v; j++)
        {
            if(j<w[i])
            {
                f[i][j]=f[i-1][j];
            }
            else
            {
                f[i][j]=max(f[i-1][j],f[i-1][j-w[i]]+c[i]);
            }
        }
    }
    return f[n][v];
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,v;
        scanf("%d%d",&n,&v);
        printf("%d\n",bag(n,v));
    }
    return 0;
}

注意骨头体积可以为0，但仍可以有价值