0/1背包~~回顾下背包~~
#include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;
int main()
{
int dp[1001],val[1001],vol[1001],cas,i,j,n,v;
scanf("%d",&cas);
while(cas --)
{
scanf("%d%d",&n,&v);
for(i = 0;i < n;i ++)
scanf("%d",&val[i]);
for(i = 0;i < n;i ++)
scanf("%d",&vol[i]);
memset(dp,0,sizeof(dp));
for(i = 0;i < n;i ++)
for(j = v;j >= vol[i];j --)
dp[j] = max(dp[j],dp[j - vol[i]] + val[i]);
printf("%d\n",dp[v]);
}
}