10分求调

#include <bits/stdc++.h>
using namespace std;
int n, m, w[105], v[105], dp[105];
int main() {
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> w[i] >> v[i];
	}
	for (int i = 1; i <= m; i++) {
		for (int j = n; j >= w[i]; j--) {
			dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
		}
	}
	cout << dp[n];
	return 0;
}