Language: C++

/**
 *    author:  otera    
**/
#include<iostream>
#include<string> 
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm> 
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

void solve() {
	int n; cin >> n;
    // vector<int> v(n, 1), w(n, 2);
    // v[0] = 100;
    vector<int> v(n), w(n);
    rep(i, n) {
        cin >> v[i] >> w[i];
    }
    int q; cin >> q;
    vector<vector<P>> res((1<<9), vector<P>());
    for(int bit = (1<<9) - 1; bit <= (1<<10) - 2; ++ bit) {
        if(bit >= n) break;
        int now = bit;
        vector<P> a;
        a.pb(P{w[now], v[now]});
        while(now != 0) {
            now = (now - 1) / 2;
            a.pb(P{w[now], v[now]});
            //if(now == 0) cerr << bit << endl; 
        }
        //cerr << (int)a.size() << endl;
        int k = bit - ((1<<9) - 1);
        rep(i, (1<<10)) {
            int sw = 0, sv = 0;
            rep(j, 10) {
                if(i & (1<<j)) {
                    sw += a[j].fr;
                    sv += a[j].sc;
                }
            }
            cerr << sw << " " << sv << endl;
            if(sw > 100000) continue;
            res[k].pb(P{sw, sv});
        }
        sort(all(res[k]));
        res[k].erase(unique(res[k].begin(), res[k].end()), res[k].end());
        //cerr << res[k].size() << " " << res[k].back().sc << endl;
    }
    while(q--) {
        int e, l; cin >> e >> l; -- e;
        int now = e;
        vector<int> es;
        es.pb(now);
        int mid = -1;
        if((1<<9) - 1 <= now && now <= (1<<10) - 2) mid = (int)es.size() - 1;
        while(now != 0) {
            now = (now - 1) / 2;
            es.pb(now);
            if((1<<9) - 1 <= now && now <= (1<<10) - 2) mid = (int)es.size() - 1;
        }
        if(mid == -1) {
            int ans = 0;
            int sz = (int)es.size();
            rep(i, (1<<sz)) {
                int sw = 0, sv = 0;
                rep(j, sz) {
                    if(i & (1<<j)) sw += w[es[j]];
                    if(i & (1<<j)) sv += v[es[j]];
                }
                if(sw <= l) {
                    chmax(ans, sv);
                }
            }
            cout << ans << endl;
        } else if(mid == 0) {
            int ans = 0;
            //assert((1<<9) > (es[0] - ((1<<9) - 1)));
          int k = es[mid] - ((1<<9) - 1);
            auto ite = upper_bound(all(res[k]), P{l, INF});
                if(ite == res[k].begin()) continue;
                -- ite;
                int tv = (*ite).sc;
                chmax(ans, sv + tv);
            cout << ans << endl;
        } else {
            int sz = mid;
            int ans = 0;
            int k = es[mid] - ((1<<9) - 1);
            
            cout << ans << endl;
        }
    }
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	solve();
    return 0;
}


Compiler output:
a.cc: In function 'void solve()':
a.cc:127:28: error: 'sv' was not declared in this scope; did you mean 'tv'?
  127 |                 chmax(ans, sv + tv);
      |                            ^~
      |                            tv