F - Bone Collector
?HDU - 2602?
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 1Sample Output
14?
AC代碼
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int n,v;
int c[1100],w[1100];
int f[1100];
int zeroone()
{for(int i=1;i<=n;i++)for(int j=v;j>=c[i];j--)f[j]=max(f[j],f[j-c[i]]+w[i]);return f[v];
}
int main()
{int num;cin>>num;while(num--){memset(f,0,sizeof(f));cin>>n>>v;for(int i=1;i<=n;i++)cin>>w[i];for(int i=1;i<=n;i++)cin>>c[i];cout<<zeroone()<<endl;}return 0;
}?
)
)
