[HDU 2602 Bone Collector] 宇宙无敌入门01背包

题目链接  http://acm.hdu.edu.cn/showproblem.php?pid=2602

Bone Collector

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 40427    Accepted Submission(s): 16801

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

  
  

   
   1
5 10
1 2 3 4 5
5 4 3 2 1
  
  

 

Sample Output

  
  

   
   14
  
  

 

Author

Teddy

 

Source

HDU 1st “Vegetable-Birds Cup” Programming Open Contest

 
直接看代码。。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int t;
int val[1010], c[1010];
int dp[1010];
void init()
{
	memset(val, 0, sizeof(val));
	memset(c, 0, sizeof(c));
	memset(dp, 0, sizeof(dp));
}
int main()
{
//	freopen("input.txt", "r", stdin);
	int n, v;
	scanf("%d", &t);
	while (t--)
	{
		init();
		scanf("%d%d", &n, &v);
		for (int i = 1; i <= n; i++)
			scanf("%d", &val[i]);
		for (int i = 1; i <= n; i++)
			scanf("%d", &c[i]);
		for (int i = 1; i <= n; i++)
			for (int j = v; j - c[i] >= 0; j--)
				dp[j] = max(dp[j], dp[j - c[i]] + val[i]);
		printf("%d\n", dp[v]);
	}
	return 0;
}