HDOJ-2602 Bone Collector(背包DP)

Bone Collector
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 32768/32768 K (Java/Others)

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

题解：

#include<bits/stdc++.h>
using namespace std;
const int N = 1005;
struct bone
{
    int value, volume;
}b[N];

int dp[N];//表示装了i容量的背包有多少价值
int main() {
    int cases; cin >> cases;
    while (cases--) {
        memset(b, 0, sizeof(b));
        memset(dp, 0, sizeof(dp));
        int n, bag; cin >> n >> bag;
        for (int i = 1; i <= n; i++) 
            cin >> b[i].value;
        for (int i = 1; i <= n; i++)
            cin >> b[i].volume;
        for (int i = 1; i <= n; i++) {
            for (int j = bag; j >= b[i].volume; j--) {
                dp[j] = max(dp[j], dp[j - b[i].volume] + b[i].value);
            }
        }
        cout << dp[bag] << endl;

    }
}