ed170.cpp

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

bool compare(int value, pair<int,pair<int,int>>& p){
    return value < p.first;
}

ll findMaxWork(vector<pair<int,pair<int,int>>>&nums, int curr, vector<ll>&dp){
    if(curr==nums.size()){
        return 0;
    }

    if(dp[curr]!=-1){
        return dp[curr];
    }

    int endTime = nums[curr].second.first;

    int findIndex = upper_bound(nums.begin(),nums.end(),endTime,compare)-nums.begin();

    ll pick = nums[curr].second.second + findMaxWork(nums,findIndex,dp);
    ll notPick = findMaxWork(nums,curr+1,dp);
    return dp[curr] = max(pick,notPick);
}


int main(){
    int x;
    cin>>x;
    vector<pair<int,pair<int,int>>> nums;
    for(int i=0;i<x;i++){
        int start,end,cost;
        cin>>start>>end>>cost;
        nums.push_back({start,{end,cost}});
    }
    sort(nums.begin(),nums.end());
    vector<ll>dp(nums.size(),-1);
    cout<<findMaxWork(nums,0,dp);

}