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 ?
InputThe first line contain a integer T , the number of cases.
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. OutputOne 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 1Sample Output
14
- #include<stdio.h>
- #include<string.h>
- #include<algorithm>
- using namespace std;
- int w[1005];
- int v[1005];
- int dp[1005];
- int main ()
- {
- int t,n,m;
- scanf("%d",&t);
- while(t--)
- {
- memset(w,0,sizeof(w));
- memset(v,0,sizeof(v));
- memset(dp,0,sizeof(dp));
- scanf("%d%d",&n,&m);
- for(int i=1;i<=n;i++)
- scanf("%d",&v[i]);
- for(int i=1;i<=n;i++)
- scanf("%d",&w[i]);
- for(int i=1;i<=n;i++)
- {
- for(int j=m;j>=0;j--)
- {
- if(j>=w[i])//程序核心代码;在max中,前者代表不放入物体i的情况,后者代表放入物体i的情况,取大值则可得最优,为什么是j-w[i]?是因为此时假设背包已经装满,拿出体积为w[i]价值为0的空气,放入体积为i价值为v[i]的骨头再取大
- dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
- }
- }
- printf("%d\n",dp[m]);
- }
- return 0;
- }
- /*
- 1
- 5 10
- 1 2 3 4 5
- 5 4 3 2 1
- */