Bone Collector

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

http://blog.sina.com.cn/s/blog_86995a7d0100vp7b.html

代码如下

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int w[1005], v[1005];
int N, maxv;
int dp[1005][1005];

int main() {
    int T;
    cin >> T;
    //w价值, v体积
    while (T--) {
        memset(dp, 0, sizeof(dp));
        cin >> N >> maxv;
        for (int i = 1; i <= N; ++i)
            cin >> w[i];
        for (int i = 1; i <= N; ++i)
            cin >> v[i];
        for (int i = 1; i <= N; ++i) {
            for (int j = 0; j <= maxv; ++j) {
                if (v[i] > j) {
                    dp[i][j] = dp[i - 1][j];
                }
                else
                    dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - v[i]] + w[i]);
            }
        }
    }
    cout << dp[N][maxv] << endl;
    return 0;
}