HDU 2602 Bone Collector (01 backpack)

Bone Collector Time limit:2000/1000 MS (java/others) Memory limit:32768/32768 K (java/others) Total submission (s): 44243 Accepted Submission (s): 18434 Problem Description Many years ago, in Teddy ' s hometown there is a man who was called "Bone Collector". 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 he trip of collecting there is a lot of bones, obviously , different bone have different value and different volume, now given the each bone's value along his trips, can you CALCU Late 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 both integer n, V, (N <=, v <=) repr Esenting 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 for each bone. Output One integer per line representing the maximum of the total value (this number would be is less than2). Sample Input 1 5 10 1 2 3) 4 5 5 4 3) 2 1 Sample Output 14 Author Teddy Source HDU 1st "Vegetable-birds Cup" programming Open Contest

1#include <iostream>2#include <cstdio>3#include <cstring>4 using namespacestd;5 intdp[1010];6 structnode7 {8     intvalue;9     intvolume;Ten}m[1010]; One intMain () A { -     intT; -Cin>>T; the     intn,v; -      while(t--){ -Cin>>n>>v; -Memset (DP,0,sizeof(DP)); +          for(intI=1; i<=n;i++) cin>>M[i].value; -          for(intI=1; i<=n;i++) cin>>M[i].volume; +          for(intI=1; i<=n;i++){ A              for(intj=v;j>=m[i].volume;j--){ atDp[j]=max (dp[j],dp[j-m[i].volume]+m[i].value); -             } -         } -cout<<dp[v]<<Endl; -     }     -     return 0; in}

HDU 2602 Bone Collector (01 backpack)