hdu 2602 整理下水题背包

最新推荐文章于 2021-08-01 08:53:01 发布

__XINGLE

最新推荐文章于 2021-08-01 08:53:01 发布

阅读量759

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/qq_29055721/article/details/46508501

版权

水题专栏收录该内容

20 篇文章 0 订阅

订阅专栏

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 2 ³¹).

Sample Input

Sample Output

#include<stdio.h>
#include<string.h>
#define max(a,b)a>b?a:b
using namespace std;
int f[10001];
int c[10001],v[10001];
int main()
{
	int T;
	int n,V;
	int i,j;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d",&n,&V);
		for(i=0;i<n;i++)
		scanf("%d",&c[i]);
		for(i=0;i<n;i++)
		scanf("%d",&v[i]);
		memset(f,0,sizeof(f));
		for(i=0;i<n;i++)  
		{  
             for(j=V;j>=v[i];j--)  
             {  
				 f[j]=max(f[j],f[j-v[i]]+c[i]);  
             }  
		}
		printf("%d\n",f[V]);
	}
}