4 solutions
-
1
#include<bits/stdc++.h> using namespace std; const int N=1010; int f[N][N],l[N],r[N]; int main() { int t,m; cin>>t>>m; for(int i=1;i<=m;i++) { cin>>l[i]>>r[i]; } for(int i=1;i<=m;i++) { for(int j=1;j<=t;j++) { f[i][j]=f[i-1][j]; if(j>=l[i]) { f[i][j]=max(f[i][j],f[i-1][j-l[i]]+r[i]); } } } cout<<f[m][t]; return 0; }
Information
- ID
- 986
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- (None)
- # Submissions
- 67
- Accepted
- 21
- Uploaded By