Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
144580 | all my people | 简单背包问题 | C++ | Wrong Answer | 0 | 0 MS | 252 KB | 306 | 2024-04-25 13:38:19 |
#include<bits/stdc++.h> using namespace std; const int N=1e3+10; int n,m; int w[N],v[N],dp[N]; int main(){ cin>>m>>n; for(int i=1;i<=n;i++){ cin>>w[i]>>v[i]; } for(int i=1;i<=n;i++){ for(int j=m;j>=w[i];j--){ dp[j]=max(dp[j],dp[j-w[i]]+v[i]); } } cout<<dp[m]; return 0; }