Bone Collector
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 ?
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 ?
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.
1 5 10 1 2 3 4 5 5 4 3 2 1
14
code:
#include <iostream> #include <cstring> using namespace std; int main(){ int t; cin >> t; while(t--){ int n,W; cin >> n >> W; long dp[1002]; long v[1002],w[1002]; int i,j; memset(dp,0,sizeof(dp)); for(i = 1; i <= n; i++) cin >> v[i]; for(i = 1; i <= n; i++) cin >> w[i]; for(i = 1; i <= n; i++){ for(j = W; j >= w[i]; j--){ dp[j] = max(dp[j],dp[j-w[i]]+v[i]); } } cout << dp[W] << endl; } return 0; }