Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 44072 Accepted Submission(s): 18369
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
Author
Teddy
Source
思路:简单题目,经典的背包问题,对于任何一件物品,可以拿也可以不拿,那么就考察下这两种情况下哪一个价值比较大
AC代码如下:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=1000+5;
struct item{
int val,vom;
}bag[maxn];
int bagg[maxn];
int main(){
int t;
scanf("%d",&t);
while(t--){
int n,v;
memset(bagg,0,sizeof(bagg));
scanf("%d%d",&n,&v);
for(int i=0;i<n;i++) scanf("%d",&bag[i].val);
for(int i=0;i<n;i++) scanf("%d",&bag[i].vom);
for(int i=0;i<n;i++){
for(int j=v;j>=bag[i].vom;j--){
bagg[j]=max(bagg[j],bagg[j-bag[i].vom]+bag[i].val);
}
}
printf("%d\n",bagg[v]);
}
return 0;
}