Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
32298 | jiabokai | 完全背包问题 | C++ | Wrong Answer | 0 MS | 268 KB | 367 | 2023-11-27 21:18:50 |
#include<bits/stdc++.h> using namespace std; int dp[300][300],w[300],c[300]; int main(){ int n,v; cin>>v>>n; for(int i=1;i<=n;i++){ cin>>w[i]>>c[i]; } for(int i=1;i<=n;i++){ for(int j=0;j<=v;j++){ if(j>=w[i]){ dp[i][j]=max(dp[i-1][j],dp[i][j-w[i]]+c[i]); }else dp[i][j]=dp[i][j]; } } cout<<"max="<<dp[n][v]; return 0; }