国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學院 > 開發設計 > 正文

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 1

Example Output

14

01背包

#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;}


發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 澎湖县| 屯昌县| 保康县| 汉川市| 嘉定区| 钦州市| 青河县| 博兴县| 张北县| 海盐县| 榆中县| 石泉县| 西吉县| 志丹县| 天等县| 天柱县| 饶平县| 周宁县| 贡山| 察哈| 咸宁市| 景宁| 河池市| 抚顺县| 安宁市| 裕民县| 武清区| 宜章县| 楚雄市| 宝清县| 筠连县| 大化| 弥渡县| 定安县| 利津县| 积石山| 渑池县| 麻阳| 河曲县| 平和县| 邵阳县|