HDU : 2602 (Bone Collector)


// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <sstream>
#include <set>
#include <math.h>
#define pi acos(-1.0)
#define N 1000000
using namespace std;


int main ()
{
    int testCase;
    scanf ("%d", &testCase);

    while ( testCase-- ) {
        int objects;
        int volume;

        scanf ("%d %d", &objects, &volume);

        int values [1000 + 10]; // get
        int weight [1000 + 10]; // paid

        for ( int i = 0; i < objects; i++ )
            scanf ("%d", &values [i]);

        for ( int i = 0; i < objects; i++ )
            scanf ("%d", &weight [i]);

        int dp [1000 + 10]; // volume size
        memset (dp, 0, sizeof (dp)); // max required

        for ( int j = 0; j < objects; j++ ) {
            for ( int i = volume; i >= 0; i-- ) {
                if ( weight [j] <= i && dp [i] < dp [i - weight [j]] + values [j] ) {
                    dp [i] = dp [i - weight [j]] + values [j];
                }
            }
        }

        printf ("%d\n", dp [volume]);
    }

    return 0;
}

// @END_OF_SOURCE_CODE

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s