Box stack I

input/code.cpp: In function 'void check(int, int)':
input/code.cpp:102:9: warning: unused variable 'lo' [-Wunused-variable]
  102 |     int lo=0, hi=n;
      |         ^~
input/code.cpp:102:15: warning: unused variable 'hi' [-Wunused-variable]
  102 |     int lo=0, hi=n;
      |               ^~

#ifdef ONPC
    #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
 
#define char unsigned char
#define rep(i, a, b) for(int i=a; i< (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
 
#define LSOne(S) ((S) & -(S))
 
using namespace std;
// mt19937 rnd(239);
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
 
typedef long long C;
typedef complex<C> P;
#define X real()
#define Y imag()
 
template<class T>
istream& operator>> (istream& is, complex<T>& p) {
    T value;
    is >> value;
    p.real(value);
    is >> value;
    p.imag(value);
    return is;
}
 
typedef long long ll;
typedef long double ld;
 
using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
 
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
 
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
 
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif
 
template<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}
template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}
 
const int INF = 1e9; // 10^9 = 1B is < 2^31-1
const ll LLINF = 4e18; // 4*10^18 is < 2^63-1
const double EPS = 1e-9;
const ll MOD = 1e9+7;
 
const int N=2020;
vector<array<int, 3>> arr;
//arr[N];
//int w[N], c[N], h[N];
multiset<array<int, 3>> v;
bool used[N];
 
int res=0, n;
 
void check(int wSum, int currH) {
    chmax(res, currH);
    int lo=0, hi=n;
    //std::cout << "max C can take: " << wSum;
    //std::cout << wSum << "<=";
    
    array<int, 3> tmp={wSum, -INF, -INF};
    int left=lower_bound(arr.begin(), arr.end(), tmp)-arr.begin();
    for (int i = left; i < n; i++) {
        if(used[i]) continue;
        used[i]=true;
        check(wSum+arr[i][1], currH+arr[i][2]);
        used[i]=false;
    }
    //__print(*it); std::cout  << std::endl;
 
    /*
    return;
    while(lo<hi) {
        int mid=(lo+hi+1)/2;
        if(arr[mid][1]<wSum) {
            lo=mid;
        } else {
            hi=mid-1;
        }
    }
    __print(arr[lo+1]);
    std::cout << lo << " " << n << std::endl;
    */
    return ;
}
 
// make {c_i, w_i, h_i}
int solve() {
    std::cin >> n;
    arr.resize(n);
    for (int i = 0; i < n; i++) {
        std::cin >> arr[i][1] >> arr[i][0] >> arr[i][2];
        //std::cin >> w[i] >> c[i] >> h[i];
        //v.insert({c[i], w[i], h[i]});
    }
 
    //check(0, 0);
 
    sort(arr.begin(), arr.end(), [&](auto &a, auto &b) {
        if(a[0]==b[0]) {
            return a[1]<b[1];
        }
        return a[0]<b[0];
    });
    
    if(false) {
    for (int i = 0; i < n; i++) {
        std::cout << arr[i][1] << " " << arr[i][0] << " " << arr[i][2] << std::endl;
    }
    std::cout  << std::endl;
    }
    //__print(arr);
    //return 0;
 
 
 
    //std::set<int> used;
    //for (int i = 0; i < n; i++) unused.insert(i);
    
    for (int i = 0; i < n; i++) {
        used[i]=true;
        //used.insert(i);
        check(arr[i][1], arr[i][2]);
        used[i]=false;
        //used.erase(i);
        //v.erase(v.find({c[i], w[i], h[i]}));
        //check(w[i], h[i]);
        //v.insert({c[i], w[i], h[i]});
    }
 
 
    std::cout << res << std::endl;
 
    return 0;
}
 
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1;
    //cin >> TET;
    for (int i = 1; i <= TET; i++) {
        #ifdef ONPC
            cout << "TEST CASE#" << i << endl;
        #endif
        
        if (solve()) {
            break;
        }
 
        #ifdef ONPC
            cout << "__________________________" << endl;
        #endif
    }
    #ifdef ONPC
        cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
    #endif
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: TIME LIMIT EXCEEDED

Test 32

Verdict: TIME LIMIT EXCEEDED

Test 33

Verdict: TIME LIMIT EXCEEDED

Test 34

Verdict: TIME LIMIT EXCEEDED

Test 35

Verdict: TIME LIMIT EXCEEDED

Test 36

Verdict: TIME LIMIT EXCEEDED

Test 37

Verdict: TIME LIMIT EXCEEDED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: TIME LIMIT EXCEEDED

Test 40

Verdict: TIME LIMIT EXCEEDED

Test 41

Verdict: TIME LIMIT EXCEEDED

Test 42

Verdict: TIME LIMIT EXCEEDED

Test 43

Verdict: TIME LIMIT EXCEEDED

Test 44

Verdict: TIME LIMIT EXCEEDED

Test 45

Verdict: TIME LIMIT EXCEEDED

Test 46

Verdict: TIME LIMIT EXCEEDED

Test 47

Verdict: TIME LIMIT EXCEEDED

Test 48

Verdict: TIME LIMIT EXCEEDED

Test 49

Verdict: TIME LIMIT EXCEEDED

Test 50

Verdict: TIME LIMIT EXCEEDED

Test 51

Verdict: TIME LIMIT EXCEEDED

Test 52

Verdict: TIME LIMIT EXCEEDED

Test 53

Verdict: TIME LIMIT EXCEEDED

Test 54

Verdict: TIME LIMIT EXCEEDED

Test 55

Verdict: TIME LIMIT EXCEEDED

Test 56

Verdict: TIME LIMIT EXCEEDED

Test 57

Verdict: TIME LIMIT EXCEEDED

Test 58

Verdict: TIME LIMIT EXCEEDED

Test 59

Verdict: TIME LIMIT EXCEEDED

Test 60

Verdict: TIME LIMIT EXCEEDED