Bone Collector HDU杭电2602 【0-1背包】

http://acm.hdu.edu.cn/showproblem.php?pid=2602

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

15 101 2 3 4 55 4 3 2 1

 

Sample Output

14

 

#include <stdio.h>#include <string.h>#define Max(a,b) (a)>(b)?(a):(b)#define N 10100int cost[N];int valu[N];int dp[N];int main(){    int T;    int n,v;    int i,j;    scanf("%d",&T);    while(T--)    {        memset(dp,0,sizeof(dp));        scanf("%d%d",&n,&v);        for(i=1;i<=n;++i)            scanf("%d",valu+i);        for(i=1;i<=n;++i)            scanf("%d",cost+i);        for(i=1;i<=n;++i)        {            for(j=v;j>=cost[i];--j)            {                dp[j]=Max(dp[j],dp[j-cost[i]]+valu[i]);            }        }        printf("%d\n",dp[v]);    }    return 0;}