解题思路
需要排序,以此保证在每个截止时间之前,截止时间小于其的课程已被考虑过。 可以写成一维数组。
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
struct lesson{
ll wait, dead, value;
}a[55];
const int N = 1e5 + 7;
ll dp[N], B, ans;
bool cmp(lesson x, lesson y)
{
return x.dead < y.dead;
}
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i].wait >> a[i].dead >> a[i].value;
}
sort(a + 1, a + n + 1,cmp);
for (int i = 1; i <= n; i++) {
for (int j = a[i].dead; j >= a[i].wait; j--) {
dp[j] = max(dp[j - a[i].wait] + a[i].value, dp[j]);
ans = max(dp[j], ans);
}
}
cout << ans << '\n';
}