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^31).

Sample Input

1
5 10
1 2 3 4 5
5 4 3 2 1

Sample Output

14

思路：0-1背包裸題

Source Program

#include<iostream> #include<cstring> using namespace std; int dp[1001]; int main() {int t;int n,v;int c[1001],w[1001];int i,j;cin>>t;while(t--){memset(dp,0,sizeof(dp));cin>>n>>v;for(i=1;i<=n;i++)cin>>w[i];for(i=1;i<=n;i++)cin>>c[i];for(i=1;i<=n;i++)for(j=v;j>=c[i];j--)dp[j]=max(dp[j],dp[j-c[i]]+w[i]);cout<<dp[v]<<endl;}return 0; }

總結

以上是生活随笔為你收集整理的Bone Collector（HDU-2602）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。