01背包

G - 01背包

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 2602

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 
       
       

 

PS:01背包问题，注意第三行输入的是价值，第四行输入的才是重量

代码：

#include<iostream>
using namespace std;

int f[1005];
int b[1005], w[1005];

int max(int a, int b)
{
	return a > b ? a : b;
}

int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n, v;
		cin >> n >> v;
		for (int i = 0; i <= v; ++i)
		{
			f[i] = 0;
		}
		for (int i = 0; i < n; ++i)
		{
			cin >> w[i];
		}
		for (int i = 0; i < n; ++i)
		{
			cin >> b[i];
		}
		for (int i = 0; i < n; ++i)
		{
			for (int j = v; j >= b[i]; --j)
			{
				f[j] = max(f[j], f[j - b[i]] + w[i]);
			}
		}
		cout << f[v] << endl;
	}

	return 0;
}