qaq，我样例都没过，大佬求教```cpp #include <bits/stdc++.h> using namespace std;

int a[65], b[65], pr[65], n, m; int c[65][2], d[32005];

int main() { scanf("%d%d", &n, &m); for (int i = 1; i <= m; i++) { int v, p, q; scanf("%d%d%d", &v, &p, &q); a[i] = v * p; pr[i] = v; if (!c[q][0]) c[q][0] = i; else c[q][1] = i; b[i] = q; } for (int i = 1; i <= m; i++) { int p = b[i], ls = c[p][0], rs = c[p][1]; for (int j = 0; j <= n; j++) { if (p) { if (pr[p] <= j) d[j] = max(d[j], d[j - pr[p]] + a[p]); if (ls && pr[p] + pr[ls] <= j) d[j] = max(d[j], d[j - pr[p] - pr[ls]] + a[p] + a[ls]); if (rs && pr[p] + pr[rs] <= j) d[j] = max(d[j], d[j - pr[p] - pr[rs]] + a[p] + a[rs]); if (ls && rs && pr[p] + pr[ls] + pr[rs] <= j) d[j] = max(d[j], d[j - pr[p] - pr[ls] - pr[rs]] + a[p] + a[ls] + a[rs]); } else if (pr[i] <= j) { d[j] = max(d[j], d[j - pr[i]] + a[i]); } } } printf("%d\n", d[n]); return 0; }