Bone Collector 2602 0-1背包問題

簡單的 0-1背包問題

#include<iostream>#include<cstdio>#include<cstring>using namespace std;int Max(int a,int b){if(a>b)return a;return b;}int main(){int t,n,v,i,j,value[1003],volume[1003];int dp[1003];scanf("%d",&t);while(t--){scanf("%d%d",&n,&v);for(i=1;i<=n;i++)scanf("%d",&value[i]);for(i=1;i<=n;i++)scanf("%d",&volume[i]);memset(dp,0,sizeof(dp));for(i=1;i<=n;i++)for(j=v;j>=volume[i];j--)dp[j]=Max(dp[j],dp[j-volume[i]]+value[i]);cout<<dp[v]<<endl;}return 0;}