hdu 2602 Bone Collector(01背包)

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 ?

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.

One integer per line representing the maximum of the total value (this number will be less than 2³¹).

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

14

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

int f[1010],c[1010],w[1010];

int main()
{
	int test,n,m;
	scanf("%d",&test);
	while(test--)
	{
		scanf("%d %d",&n,&m);
		for(int i = 1; i <= n; i++)
			scanf("%d",&w[i]);
		for(int i = 1; i <= n; i++)
			scanf("%d",&c[i]);
		memset(f,0,sizeof(f));
		for(int i = 1; i <= n; i++)
		{
			for(int j = m; j >= c[i]; j--)//体积逆序
			{
				f[j] = max(f[j], f[j-c[i]]+w[i]);
			}
		}

		printf("%d\n",f[m]);
	}
	return 0;
}