#include <iostream> #include <vector> #include <algorithm> using namespace std; struct good { int a,b; }; bool cmp(good A,good B) { return A.a<b.a>>n; vector<good> goods; for(int i=0;i<n>>a>>b; goods.push_back({a,b}); } sort(goods.begin(),goods.end(),cmp); int q;cin>>q; vector<int>MAX(n); MAX[0]=goods[0].b; for(int i=1;i<n>>x; int p=upper_bound(goods.begin(),goods.end(),good{x,0},cmp)-goods.begin(); if(p==0) { cout<<-1<</n></int></n></good></b.a></algorithm></vector></iostream>