Link to this code:
https://cses.fi/paste/5ab9d7b8fe7cc7a7e0a8d3/#include <algorithm>
#include <array>
#include <bits/stdc++.h>
using namespace std;
#define in(a) \
for (auto &x : a) \
cin >> x;
#define out(a) \
for (auto x : a) \
cout << x << " ";
#define pb push_back
#define int long long
#define ll long long
typedef vector<ll> vi;
typedef pair<ll, ll> pii;
int dp[200002];
void solve() {
int n;
cin >> n;
vector<array<int, 3>> v;
for (int i = 0; i < n; i++) {
int start, end, score;
cin >> start >> end >> score;
v.push_back({start, end, score});
dp[i] = -1;
}
sort(v.begin(), v.end(),
[](array<int, 3> &a, array<int, 3> &b) { return a[0] < b[0]; });
for (int i = n - 1; i >= 0; i--) {
int next = upper_bound(v.begin(), v.end(), v[i],
[](const array<int, 3> &a, const array<int, 3> &b) {
return a[1] < b[0];
}) -
v.begin();
dp[i] = max(dp[next] + v[i][2], dp[i + 1]);
}
cout << dp[0] << '\n';
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}