Bone Collector

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

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

Author

Teddy

Source

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

#include <cstdio>

#include <iostream>

#include <sstream>

#include <cmath>

#include <cstring>

#include <cstdlib>

#include <string>

#include <vector>

#include <map>

#include <set>

#include <queue>

#include <stack>

#include <algorithm>

using namespace std;

#define ll long long

#define _cle(m, a) memset(m, a, sizeof(m))

#define repu(i, a, b) for(int i = a; i < b; i++)

#define repd(i, a, b) for(int i = b; i >= a; i--)

#define sfi(n) scanf("%d", &n)

#define sfl(n) scanf("%I64d", &n)

#define pfi(n) printf("%d\n", n)

#define pfl(n) printf("%I64d\n", n)

#define MAXN 1005

int dp[MAXN];

int v[MAXN];

int p[MAXN];

int main()

{

    int T;

    sfi(T);

    while(T--)

    {

        _cle(dp, );

        int n, m;

        sfi(n), sfi(m);

        repu(i, , n) sfi(p[i]);

        repu(i, , n) sfi(v[i]);

        repu(i, , n)

        for(int j = m; j >= v[i]; j--)

            dp[j] = max(dp[j], dp[j - v[i]] + p[i]);

        pfi(dp[m]);

    }

    return ;

}

巴特西

HDU 2602(01背包)

Bone Collector

最新文章

热门文章