HDU 2602

Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 38878 Accepted Submission(s): 16115

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

典型01背包，转移方程dp[j] = max(dp[j],dp[j - w[i]] + v[i]);没什么好说的

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int dp[1010];
int v[1010];
int w[1010];

int main()
{
    int N;
    scanf("%d",&N);
    int i,j;
    while(N--){
        int n,V;
        scanf("%d%d",&n,&V);
        memset(dp,0,sizeof(dp));
        for(i = 1;i<=n;i++)
            scanf("%d",&v[i]);
        for(i = 1;i<=n;i++)
            scanf("%d",&w[i]);

        for(i = 1;i<=n;i++)
            for(j = V;j>=w[i];j--)
                dp[j] = max(dp[j],dp[j - w[i]] + v[i]);

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


    }
    return 0;
}