Bone Collector——杭电2601.doc

Bone Collector——杭电2601 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 #includeiostream using namespace std; int max(int a,int b) { if(ab) return a; return b; } int z[1005]; int main() { int m; cinm; for(int i=0;im;i++) { int n,b; cinnb; int *v=new int[n]; int *w=new int[n]; memset(z,0,1005*sizeof(int)); for(int k=0;kn;k++) cinv[k]; for(int k=0;kn;k++) cinw[k]; for(int k=0;kn;k++) for(int j=b;j=0;j--) if(w[k]=j) z[j]=max(z[j],z[j-w[k]]+v[k]); coutz[b]endl; } return 0; }