if you RE #9#10 too

#include <bits/stdc++.h>

using namespace std;

const int maxx = 1e5;
long long dp[maxx];
int main(){
	int t,m;
	cin >> t >> m;
    vector <int> a(m);
    vector <int> b(m);
	for(int i = 0;i < m ;i++){
        cin >> a[i] >> b[i];
    }
	for(int i = 0;i < m;i++){
		for(int j = a[i];j <= t;j++){
			dp[j] = max(dp[j],dp[j - a[i]] + b[i]);
		}
	}
	cout << dp[t] << endl;
    return 0;
}