Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 57085 Accepted Submission(s): 23820
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 ?
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.
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
又是一道01背包的题目
先定义一个结构体,然后排序好后进行 dp[j]=max(dp[j],dp[j-x[i].b]+x[i].a); 即可
结构体排序代码是
bool cmp(const bone q,const bone w){
return q.a>w.a;
}
下面是ac代码:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<iostream>
using namespace std;
typedef struct bone{
int a;
int b; //a means value b means volume
}bone;
bone x[1001];
int dp[999999];
bool cmp(const bone q,const bone w){
return q.a>w.a?w.a:q.a;
}
int main()
{
int zu,n,j,i,k,v;
scanf("%d",&zu);
while(zu--)
{
memset(x,0,sizeof(x));
memset(dp,0,sizeof(dp));
scanf("%d%d",&n,&v);
for(i=0;i<n;i++)
{
scanf("%d",&x[i].a);
}
for(i=0;i<n;i++)
{
scanf("%d",&x[i].b);
}
sort(x,x+n,cmp);
for(i=0;i<n;i++)
{
for(j=v;j>=x[i].b;j--)
{
dp[j]=max(dp[j],dp[j-x[i].b]+x[i].a);
}
}
printf("%d\n",dp[v]);
}
}