01 backpack template question. Is to find the biggest value in a certain space, Bone Collector
Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)
Total submission (s): 22041 accepted submission (s): 8912
Problem descriptionpolicyears 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
Maximum Of the total value the bone collector can get?
Inputthe 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.
Outputone integer per line representing the maximum of the total value (This number will be less than 231 ).
Sample Input
15 101 2 3 4 55 4 3 2 1
Sample output
14
#include <stdio.h>int max(int x, int y){ if(x > y) return x; else return y;}int dp[1010][1010];int main(){ int t, n, v, i, j; int c[10101], w[10101]; while(~scanf("%d",&t)) { while(t--) { scanf("%d %d",&n, &v); for(i = 1; i <= n; i++) scanf("%d",&w[i]); for(i = 1; i <= n; i++) scanf("%d",&c[i]); for(i = 0; i <= n; i++) dp[i][0] = 0; for(i = 0; i <= v; i++) dp[0][i] = 0; for(i = 1; i <= n; i++) { for(j = 0; j <= v; j++) { dp[i][j] = dp[i-1][j]; if(j >= c[i]) dp[i][j] = max(dp[i-1][j] , dp[i-1][j-c[i]] + w[i]); } } printf("%d\n",dp[n][v]); } } return 0;}