Shared code

#include <bits/stdc++.h>
#define int long long
using namespace std;
#define Y cout << "YES" \
               << "\n"
#define N cout << "NO" \
               << "\n"
#define pb push_back
#define endl "\n"
#define lowestbit(x) __builtin_ffs(x)  //returns 1+index of(lowest bit)
#define highestbit(x) __builtin_clz(x) //returns number of 0's to left of MST
#define is(x) cerr << #x << " is " << x << "\n";
#define full(v1) v1.begin(), v1.end()
#define loop(i, a, b) for (int i = (a); i < (b); i++)
#define inputarr loop(i, 0, n) cin >> ar[i];
int mod = 1e9 + 7;
int inf = 1e18;
int mx = -1;
int mn = 1e18;
int calpow(int a, int b, int md)
{
    int mul = 1;
    while (b > 0)
    {
        if (b & 1)
        {
            mul = ((a % md) * (mul % md)) % md;
            b--;
        }
        else
        {
            a = ((a % md) * (a % md)) % md;
            b /= 2;
        }
    }
    return mul;
}
 
bool cmp(pair<int, int> p1, pair<int, int> p2) 
{
    return p2.second >= p1.second;
}
 
void solve()
{
    int i, j, n, t, q, a, b, m, k, ct = 0, sum = 0, flag = 0;
    vector<pair<int, int>> pr;
    vector<pair<int, int>> v;
    vector<int> v1;
    cin >> n;
    pr.pb({0, 0});
    v.pb({0, 0});
    v1.pb(0);
    loop(i, 0, n)
    {
        cin >> j >> k >> m;
        v1.pb(k);
        pr.pb({j, k});
        v.pb({k, m});
    }
    sort(v1.begin(), v1.end());
    sort(v.begin(), v.end());
    sort(pr.begin(), pr.end(), cmp);
    int dp[n + 1];
    dp[0] = 0;
    // for(auto i:pr)
    // is(i.first);
    // for(auto i:v1)
    // is(i);
    for (i = 1; i <= n; i++)
    {
        auto it = lower_bound(v1.begin(), v1.end(),pr[i].first);
        if (*it>= pr[i].first)
        {
            it--;
        }
        m = it - v1.begin();
        dp[i] = max(dp[i - 1], v[i].second + dp[m]);
    }
    cout << dp[n];
}
signed main()
{
    //freopen("lineup.in","r",stdin);
    //freopen("lineup.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    // WATCH FOR SAME VARIABLE USAGE CLEARLY!!!
    //MAKE SURE TO MAKE A DUPLICATE OF ANYTHING IF PERFORMING OPERATION DIRECTLY ON SOMETHING !!!
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
        cout << "\n";
    }
 
    cerr << clock() * 1000.0 / CLOCKS_PER_SEC << 'm' << 's';
    return 0;
}