| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 67613 | 老师 | 竞赛总分 | C++ | Runtime Error | 0 | 0 MS | 88 KB | 342 | 2023-01-14 16:57:53 |
#include<bits/stdc++.h> using namespace std; const int M=10010,N=10010; int dp[N][M]; int main(){ int m,n; cin>>m>>n; for(int i=1;i<=n;i++){ int si,ti; cin>>si>>ti; for(int j=1;j<=m;j++){ for(int k=0;k*ti<=j;k++){ dp[i][j]=max(dp[i][j],dp[i-1][j-k*ti]+k*si); } } } cout<<dp[n][m]<<endl; return 0; }