HDU2602 Bone Collector（DP）

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

背包问题中基础的题型（还是难啊……）

#include <iostream>
#include <cstdio>
#include <algorithm>


using namespace std;

int bone[1005][2];
int value[1005];


int main()
{
	int t, n, v;
	cin >> t;
	while (t--)
	{
		cin >> n >> v;
		memset(value, 0, sizeof(value));
		for (int i = 0; i < n; i++)
			scanf_s("%d", &bone[i][0]);
		for (int i = 0; i < n; i++)
			scanf_s("%d", &bone[i][1]);
		for (int i = 0; i < n; i++)
			for (int j = v; j >= 0; j--)
				if (j >= bone[i][1])
					value[j] = max(value[j], value[j - bone[i][1]] + bone[i][0]);


		cout << value[v] << endl;

	}

	return 0;
}

"There is no certainty, only opportunity."