hdoj2602 Bone Collector

2019-11-08 02:50:24

字体：大中小

来源：转载

供稿：网友

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 ?

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 231).

Example Input

15 101 2 3 4 55 4 3 2 1Example Output
1401背包
#include <iostream>#include <cstdio>#include <string.h>using namespace std;int main(){    int t,n,v,i,j;    int vi[1005],ci[1005],a[1005];    cin>>t;    while(t--)    {        memset(a,0,sizeof(a));        cin>>n>>v;        for(i=1;i<=n;i++)        {            cin>>vi[i];        }        for(i=1;i<=n;i++)        {            cin>>ci[i];        }        for(i=1;i<=n;i++)        {            for(j=v;j>=ci[i];j--)            {                a[j]=max(a[j],a[j-ci[i]]+vi[i]);            }        }        printf("%d/n",a[v]);    }	return 0;}

上一篇：vagrant的配置文件vagrantfile详解

下一篇：STL 栈stack的使用