AcWing 426. 开心的金明
AC
# include <bits/stdc++.h>
using namespace std;
const int N = 3e4+10;
typedef long long ll;
ll dp[N];
int main(){
int n, m;
scanf("%d%d", &n, &m);
for(int i = 1; i <= m ; i++ ){
int v, w;
scanf("%d%d", &v, &w);
for(int j = n; j>=v; j -- )dp[j]=max(dp[j],dp[j-v]+v*w);
}
cout<<dp[n];
return 0;
}