题解

#include<bits/stdc++.h>
using namespace std;

int w[40], v[40];
int dp[210][210];

int main() {
int c, n;
cin >> c >> n;
for(int i = 1; i <= n; i++) {
cin >> v[i] >> w[i];
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= c; j++) {
if(j < v[i]) {
dp[i][j]=dp[i - 1][j];
}else {
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - v[i]] + w[i]);
}
}
}
cout << dp[n][c] << endl;
return 0;
}