#include <bits/stdc++.h> using namespace std; int sum[10005], dp[10005]; struct S{ int a, b; } z[10005]; int cmp(const S & a, con$$st S & b){ return a.a> b.a; } int main(){ int n, k, num = 1; cin >> n >> k; f$$$$or (int i$$$$ = 1; i <= k; i$$$++){ cin >> z[i].a >> z[i].b; sum[z[i].a] ++; } sort(z + 1, z$$$ + k + 1, cmp); for (int $$$$i = n; i >= 1;$$$$ i --){ if (sum[i] == 0) dp[i] = dp[i + 1] + 1; else{$$$$ for (in$$$t j = 1; j <$$$= sum[i]; j ++){ if (dp[i$$$$$+ z[num].b] > dp[i]) dp[i] = dp[i + z[num].b]; num ++; } } } cout << dp[1]; return 0; }$

Welcome 2024stu051

谁有Domain - Cplus(思加) - 尼克的任务的题解