Language: C++

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

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    SPEED
    int N; cin >> N;
    vector<int> V(N+1),W(N+1);
    for(int i = 1; i <= N; ++i) {
        cin >> V[i] >> W[i];
    }
    int Q; cin >> Q;
    string ans_str="";
    while(Q--) {
        int p; int Z; cin >> p >> Z;
        vector<int> l,r;
        int k = 2*p;
        while(k/=2) {
            if(l.size()<=9) l.push_back(k);
            else r.push_back(k);
        }
        int nl = l.size(),nr = r.size();
        vector<pair<ll,ll>> sl(1<<nl,{0,0}),sr(1<<nr,{0,0});
        for(int i = 0; i < (1<<nl); ++i) {
            for(int j = 0; j < nl; ++j) {
                if(!(i&(1<<j))) continue;
                sl[i].first += W[l[j]];
                sl[i].second += V[l[j]];
            }
        }
        for(int i = 0; i < (1<<nr); ++i) {
            for(int j = 0; j < nr; ++j) {
                if(!(i&(1<<j))) continue;
                sr[i].first += W[r[j]];
                sr[i].second += V[r[j]];
            }
        }
        sort(ALL(sl));
        sort(ALL(sr));
        for(int i = 1; i < sl.size(); ++i) {
            chmax(sl[i].second,sl[i-1].second);
        }
        for(int i = 1; i < sr.size(); ++i) {
            chmax(sr[i].second,sr[i-1].second);
        }
        int ans = 0;
        vector<ll> ssr(sr.size());
        for(int i = 1; i < sr.size(); ++i) {
            ssr[i] = sr[i].first;
        }
        for(auto& pl:sl) {
            int x = pl.first;
            if(x > Z) continue;
            int y = Z - x;
            int idx = upper_bound(ALL(ssr),y) - ssr.begin();
            idx--;
            int a = pl.second;
            int b = sr[idx].second;
            chmax(ans,a+b);
        }
        ans_str += to_string(ans)+"\n";
    }
    cout << ans_str;

    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:93:10: error: ambiguous overload for 'operator<<' (operand types are 'std::ostream' {aka 'std::basic_ostream<char>'} and 'std::string' {aka 'std::__cxx11::basic_string<char>'})
   93 |     cout << ans_str;
      |     ~~~~ ^~ ~~~~~~~
      |     |       |
      |     |       std::string {aka std::__cxx11::basic_string<char>}
      |     std::ostream {aka std::basic_ostream<char>}
a.cc:25:60: note: candidate: 'std::ostream& operator<<(std::ostream&, const T<U>&) [with T = std::__cxx11::basic_string; U = char; std::ostream = std::basic_ostream<char>]'
   25 | template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
      |                                                            ^~~~~~~~
In file included from /usr/include/c++/14/string:54,
                 from /usr/include/c++/14/bitset:52,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52,
                 from a.cc:1:
/usr/include/c++/14/bits/basic_string.h:4077:5: note: candidate: 'std::basic_ostream<_CharT, _Traits>& std::operator<<(basic_ostream<_CharT, _Traits>&, const __cxx11::basic_string<_CharT, _Traits, _Allocator>&) [with _CharT = char; _Traits = char_traits<char>; _Alloc = allocator<char>]'
 4077 |     operator<<(basic_ostream<_CharT, _Traits>& __os,
      |     ^~~~~~~~