// >>> TEMPLATES #include using namespace std; using ll = long long; using ld = long double; using i32 = int32_t; using i64 = int64_t; #define int ll #define double ld #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define rep1(i,n) for (int i = 1; i <= (int)(n); i++) #define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i,n) for (int i = (int)(n); i >= 1; i--) #define loop(i,a,B) for (int i = a; i B; i++) #define loopR(i,a,B) for (int i = a; i B; i--) #define all(x) (x).begin(), (x).end() #define allR(x) (x).rbegin(), (x).rend() #define pb push_back #define eb emplace_back #define mp make_pair #define fst first #define snd second auto constexpr INF32 = numeric_limits::max()/2-1; auto constexpr INF64 = numeric_limits::max()/2-1; auto constexpr INF = numeric_limits::max()/2-1; #ifdef LOCAL #include "debug.hpp" #define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__) #define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl #define debug if (1) #else #define dump(...) (void)(0) #define say(x) (void)(0) #define debug if (0) #endif template using pque_max = priority_queue; template using pque_min = priority_queue, greater >; template ::value>::type> ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; } template ::value>::type> istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; } template istream& operator>>(istream& is, pair& p) { return is >> p.first >> p.second; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward(f)) {} template constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward(x)...); } }; struct MakeFixPoint { template constexpr auto operator|(F&& f) const { return FixPoint(forward(f)); } }; #define MFP MakeFixPoint()| #define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__) template struct vec_impl { using type = vector::type>; template static type make_v(size_t n, U&&... x) { return type(n, vec_impl::make_v(forward(x)...)); } }; template struct vec_impl { using type = T; static type make_v(T const& x = {}) { return x; } }; template using vec = typename vec_impl::type; template auto make_v(Args&&... args) { return vec_impl::make_v(forward(args)...); } template void quit(T const& x) { cout << x << endl; exit(0); } template constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; } template constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; } template constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits::value_type{}); } template int sz(T const& x) { return x.size(); } template int lbd(C const& v, T const& x) { return lower_bound(v.begin(), v.end(), x)-v.begin(); } template int ubd(C const& v, T const& x) { return upper_bound(v.begin(), v.end(), x)-v.begin(); } template int ppt(C const& v, F f) { return partition_point(v.begin(), v.end(), f)-v.begin(); } // <<< // >>> reord void reord_impl(vector const&) { } template void reord_impl(vector const& idx, vector &v, Args&&... args) { vector t(v.size()); rep (i,v.size()) t[i] = v[idx[i]]; swap(v,t); reord_impl(idx, forward(args)...); } template ()(0,0))> void reord(Comp comp, vector &v, Args&&... args) { vector idx(v.size()); iota(idx.begin(), idx.end(), 0); sort(idx.begin(), idx.end(), comp); reord_impl(idx, v, args...); } template void reord(vector &v, Args&&... args) { vector idx(v.size()); iota(idx.begin(), idx.end(), 0); sort(idx.begin(), idx.end(), [&](int i, int j) { return v[i] < v[j]; }); reord_impl(idx, v, args...); } // <<< // >>> segment tree template struct Segtree : Handler { using Value = typename Handler::Value; using Handler::unit; // () -> Value using Handler::merge; // (Value,Value) -> Value vector v; // use v[1..2*cap-1] int cap; // // capacity: power of 2 int n; // original size Segtree() {} template Segtree(T&&... x) { init(forward(x)...); } template ()(0))> void init(int n, F gen) { assert(n >= 0); this->n = n; cap = n; //for (cap = 1; cap < n; cap <<= 1) ;; v.resize(2*cap, unit()); for (int i = 0; i < n; i++) v[cap+i] = gen(i); for (int i = cap-1; i >= 1; i--) v[i] = merge(v[2*i],v[2*i+1]); } void init(int n) { init(n, [&](int) { return unit(); }); } void init(int n, Value const& x) { init(n, [&](int) { return x; }); } void init(vector const& v) { init(v.size(), [&](int i) { return v[i]; }); } int size() const { return n; } void set(int i, Value const& x) { assert(0 <= i); assert(i < size()); i += cap; v[i] = x; while (i > 1) i >>= 1, v[i] = merge(v[2*i],v[2*i+1]); } Value operator[](int i) const { return get(i); } Value get(int i) const { assert(0 <= i); assert(i < size()); return v[cap + i]; } // [l,r) Value get(int l, int r) const { assert(0 <= l); assert(l <= r); assert(r <= size()); Value x = unit(), y = unit(); for (l += cap, r += cap; l < r; l >>= 1, r >>= 1) { if (l&1) x = merge(x, v[l++]); if (r&1) y = merge(v[--r], y); } return merge(x,y); } vector dat() const { vector ret(size()); for (int i = 0; i < size(); i++) ret[i] = get(i); return ret; } }; // <<< struct RangeMax { using Value = int; constexpr static Value unit() { return 0; } constexpr static Value merge(Value x, Value y) { return max(x,y); } }; int32_t main() { int n; cin >> n; vector a(n),b(n),c(n); rep (i,n) cin >> a[i] >> b[i] >> c[i]; reord(a,b,c); dump(a,b,c); vector> v; rep (i,n) v.eb(b[i],-i); sort(all(v)); Segtree seg(n,0); for (auto p : v) { int i = -p.snd; int lb = lbd(a,a[i]); int val = seg.get(0,lb) + c[i]; dump(p,lb,val); seg.set(i,val); } cout << seg.get(0,n) << endl; }