A - Bone Collector
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 ?
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
#include<stdio.h>
#include<string.h>
int f[1500],b[1500],z,w[1500],v[1500];
int max(int x,int y)
{if(x<y)x=y;return x;
}
int main()
{int i,j,m,n,k,s,t;while(scanf("%d",&t)!=EOF){while(t--){ scanf("%d%d",&n,&m);for(i=1;i<=n;i++){scanf("%d",&w[i]);}for(i=1;i<=n;i++){scanf("%d",&v[i]);}memset(f,0,sizeof(f)); for(i=1;i<=n;i++) {for(j=m;j>=v[i];j--) { f[j]=max(f[j],f[j-v[i]]+w[i]); }} printf("%d\n",f[m]);}}return 0;
}