20pts求条

#include <bits/stdc++.h>
using namespace std;
int t2[10005],value[10005];
int dp[10000010];
int main() {
	int t,n;
	cin >> t >> n;
	int sum = 0;
	for (int i=1;i<=n;++i) {
		cin >> t2[i] >> value[i];
		sum += t2[i]; 
	}
	for (int i=1;i<=n;++i) {
		for (int j=t2[i];j<=sum;++j) dp[j] = max(dp[j],dp[j - t2[i]] + value[i]);
	}
	int ans = 0;
	for (int i=1;i<=t;++i) ans = max(ans,dp[i]);
	cout << ans;
	return 0;
}