Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 32116 Accepted Submission(s): 13224
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 ?
![](https://i-blog.csdnimg.cn/blog_migrate/0bf307b7a4c44236bd26a289041b24d5.jpeg)
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
将v体积的物品放入到背包中,若不能放入 则背包内价值不变,否则则取
max(v[i-1][V],v[i-1][V-v]+m[i])
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int v[1010][1010];
struct ssss
{
int m,v;
}ss[1010];
/*bool compare(ssss a,ssss b)
{
return a.v<b.v;
}*/
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
int V,t;
scanf("%d%d",&t,&V);
for(int i=1;i<=t;i++)
scanf("%d",&ss[i].m);
for(int i=1;i<=t;i++)
scanf("%d",&ss[i].v);
//sort(ss,ss+t,compare);
for(int i=0;i<=V;i++)
for(int j=0;j<=V;j++)
v[i][j]=0;
for(int i=1;i<=t;i++)
{
for(int j=V;j>=0;j--)
{
if(j<ss[i].v)
{
v[i][j]=v[i-1][j];
continue ;
}
if(v[i-1][j]<v[i-1][j-ss[i].v]+ss[i].m)
v[i][j]=v[i-1][j-ss[i].v]+ss[i].m;
else v[i][j]=v[i-1][j];
}
}
cout<<v[t][V]<<endl;
}
}