HDU 2602

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 231).

Sample Input
1
5 10
1 2 3 4 5
5 4 3 2 1

Sample Output
14

01背包的模板问题
这篇博客讲的清晰 https://blog.csdn.net/mu399/article/details/7722810

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int v,n;
		scanf("%d %d",&n,&v);
		int x[1005],y[1005],dp[10005];
		for(int i=0;i<n;i++){
			scanf("%d",&x[i]);
		}
		for(int i=0;i<n;i++){
			scanf("%d",&y[i]);
		}
		for(int i=0;i<=v;i++){
			dp[i]=0;
		}
		for(int i=0;i<n;i++){
			for(int j=v;j>=y[i];j--){
				dp[j]=max(dp[j],dp[j-y[i]]+x[i]);
			}
		}
        printf("%d\n",dp[v]);
	}
	return 0; 
 }