90pts求调

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

const int N = 1e4 + 5;
const int M = 1e7 + 5;

int t, m;
int a[N], b[N], dp[M];

signed main() {
    scanf("%d %d", &t, &m);
    for (int i = 1; i <= m; i ++) 
        scanf("%d %d", &a[i], &b[i]);

    for (int i = 1; i <= m; i ++) {
        for (int j = a[i]; j <= t; j ++) {
            dp[j] = max(dp[j], dp[j - a[i]] + b[i]);
        }
    }

    printf("%d", dp[t]);
    return 0;
}