杭电2602-0-1背包模板题

#include <iostream>#include <cstdio>#include <cstring>using namespace std;int N,V;int w[1010],v[1010];int dp[1010];void ZeroOnepack(){for(int i=1;i<=N;i++){for(int j=V;j>=w[i];j--){dp[j]=max(dp[j],dp[j-w[i]]+v[i]);}}}int main(){int T,i;scanf("%d",&T);while(T--){scanf("%d%d",&N,&V);for(i=1;i<=N;i++)cin>>v[i];for(i=1;i<=N;i++)cin>>w[i];memset(dp,0,sizeof(dp));ZeroOnepack();cout<<dp[V]<<endl;}return 0;}