T735850 购物

#include<bits/stdc++.h>
using namespace std;
#define CO const
#define PB push_back
using CI=CO int;using LL=long long;
using CL=CO LL;constexpr int N=5e5+5;
#define AR array
#define FOR(i,l,r) for(int i=(l);i<=(r);++i)
#define FER(i,r,l) for(int i=(r);i>=(l);--i)
LL GE(CL a[],CI x){return a[x]-(x==1?0:a[x-1]);}
#define Fque(Que,EE)\
int Que(CL a[],LL x){\int ans=0;\FER(i,20,0){\CI An=(1<<i)+ans;\if(An<=a[0]&&(EE)<=x)ans=An;\}\return ans;\
}
Fque(que1,a[An])Fque(que2,GE(a,An))
#define Sort(a) sort(a+1,a+1+a[0])
void read(LL a[]){FOR(i,1,a[0])cin>>a[i];}
void did(LL a[]){Sort(a);FOR(i,2,a[0])a[i]+=a[i-1];}
void add(LL a[],CL b[]){FOR(i,a[0]+1,a[0]+b[0])a[i]=b[i-a[0]];a[0]+=b[0];
}
LL a[2][N],za[N],c[2][N];
LL v[4][2][N];
int get(CI ea,CI ec,AR<LL,2>x){auto w=v[ea][ec];CI p=que1(w,x[0]+x[1]);FOR(i,0,1)if(ea&(1<<i)){CI pa=que2(a[i],GE(w,p));if(a[i][pa]>x[i]){CI rpa=que1(a[i],x[i]);x[i]-=a[i][rpa];return rpa+get(ea-(1<<i),ec,x);}}return p;
}
int main(){ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);cin>>a[0][0]>>a[1][0]>>za[0];read(a[0]),read(a[1]),read(za);Sort(za);c[0][0]=za[0]/2;FOR(i,1,c[0][0])c[0][i]=za[i*2-1]+za[i*2];c[1][0]=((za[0]-1)>>1)+1,c[1][1]=za[1];FOR(i,2,c[1][0])c[1][i]=za[i*2-2]+za[i*2-1];FOR(ea,0,3)FOR(ec,0,1){auto w=v[ea][ec];FOR(i,0,1)if(ea&(1<<i))add(w,a[i]);add(w,c[ec]);did(w);}FOR(e,0,1)did(a[e]),did(c[e]);int T;cin>>T;while(T--){AR<LL,2>x;cin>>x[0]>>x[1];cout<<max(get(3,0,x)*2,get(3,1,x)*2-1)<<'\n';}return 0;
}