Bone Collector（记忆化搜索）

Bone Collector

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 31).
Sample Input
1
5 10
1 2 3 4 5
5 4 3 2 1
Sample Output
14

求在一定的体积中，得到最高的价值

ac代码：

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

int w[1005];
int v[1005];
int dp[1005][1005];
int n,m;
int t;



int main(){
	cin>>t;
	while(t--){
		cin>>n>>m;
		for(int i=1;i<=n;i++){
			cin>>w[i];
		}
		for(int j=1;j<=n;j++){
			cin>>v[j];
		}
	
		memset(dp,0,sizeof(dp));
	
		for(int i=1;i<=n;i++){//每个的v 	cout<<"***";
		
			for(int j=0;j<=m;j++){
				if(j>=v[i]){
					dp[i][j]=max(dp[i-1][j],dp[i-1][j-v[i]]+w[i]);
				}
				else dp[i][j]=dp[i-1][j];
				//cout<<dp[i][j]<<" ";
			}
			//cout<<endl;
		}
		cout<<dp[n][m]<<endl;
	}
	return 0;
}