Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
41196 | jiabokai | 最大价值 | C++ | Accepted | 0 MS | 260 KB | 364 | 2024-02-20 09:28:15 |
#include<bits/stdc++.h> using namespace std; int dp[101][1001],w[101],c[101]; 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-1][j-w[i]]+c[i]); }else dp[i][j]=dp[i-1][j]; } } cout<<dp[n][v]; return 0; }