HDU2602 (0-1 backpack problem), hdu26020-1 backpack Problem

HDU2602 (0-1 backpack problem), hdu26020-1 backpack Problem
N-01 backpackTime Limit:1000 MSMemory Limit:32768KB64bit IO Format:% I64d & % I64u

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, obviusly, 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 instances.
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 31 ).

Sample Input

15 101 2 3 4 55 4 3 2 1

Sample Output

14 Question: 0-1 backpack problem, dp [I] [j] indicates the maximum value of I items j

#include<iostream>#include<cstring>#include<cstdio>using namespace std;int dp[1000][1000];int a[1000],b[1000];int main(){    int t,n,v;    cin>>t;    while(t--)    {        cin>>n>>v;        for(int i=1;i<=n;i++)            scanf("%d",&a[i]);        for(int i=1;i<=n;i++)            scanf("%d",&b[i]);        memset(dp,0,sizeof(dp));         for(int i=1;i<=n;i++)        {            for(int j=0;j<=v;j++)            {                dp[i][j]=(i==1?0:dp[i-1][j]);                if(j>=b[i])                    dp[i][j]=max(dp[i-1][j],dp[i-1][j-b[i]]+a[i]);            }        }        printf("%d\n",dp[n][v]);    }    return 0;}