HDOJ2602 Bone Collector 01背包模板题

#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
int n,V;
int dp[1005];
int v[1005],w[1005];    //价值和重量
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		scanf("%d%d",&n,&V);		
		memset(dp,0,sizeof(dp));
		for(int i = 1;i <= n;i++)
			scanf("%d",&v[i]);
		for(int i = 1;i <= n;i++)
			scanf("%d",&w[i]);	
		for(int i = 1;i <= n;i++)                    //一维01背包
			for(int j = V;j >= w[i] ;j--)	    
				dp[j] = max(dp[j],dp[j-w[i]]+v[i]);
			
		printf("%d\n",dp[V]);
	}
	return 0;
}