HDU 2602 Bone Collector(裸01背包)

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=1010;
int dp[maxn],v[maxn],w[maxn],n,m;

int main(){
	int t;
	scanf("%d",&t);
	while (t--){
		memset(v,0,sizeof(v));
		memset(w,0,sizeof(w));
		memset(dp,0,sizeof(dp));

		scanf("%d%d",&n,&m);
		for (int i=0;i<n;++i){
			scanf("%d",&v[i]);
		}
		for (int j=0;j<n;++j){
			scanf("%d",&w[j]);
		}
		
		for (int i=0;i<n;++i){
			for (int j=m;j>=w[i];--j){
				dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
			}
		}
		printf("%d\n",dp[m]);
	}
	return 0;
}