顶级厨师(E)
思路: 首先是二分答案,然后对于某个mid,我们只需要统计所有小于等于mid的匹配的对数cnt,如果cnt>=x则代表当前选择的这个太大了,所以要缩小范围,否则要扩大范围,而对于统计数量,我们只需要对b排序,然后枚举a,然后对于某个a[i],我们只需要知道b中小于等于mid/a[i]的个数,因为这样才能够保证a*b<=mid,而对于求这个个数,我们可以再用一次二分得到答案,而对于二分我们可以用upper_bound函数算出来,另外对于题中不能组合的限制,我们可以用一个数组存下来,同时排序,然后我们只需要知道在数组中小于等于mid的个数,然后将这两个数相减得到的就是小于等于mid的个数,然后直到二分完成即可
#include<iostream>
#include<cstring>
#include<string>
#include<sstream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<vector>
#include<set>
#include<unordered_map>
#include<ctime>
#include<cstdlib>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
typedef pair<int,pair<int,int> > PIII;
const double eps=1e-7;
const int N=5e5+7 ,M=5e5+7, INF=0x3f3f3f3f,mod=1e9+7;
const long long int llINF=0x3f3f3f3f3f3f3f3f;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
inline void write(ll x) {if(x < 0) {putchar('-'); x = -x;}if(x >= 10) write(x / 10);putchar(x % 10 + '0');}
inline void write(ll x,char ch) {write(x);putchar(ch);}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
bool cmp0(int a,int b) {return a>b;}
template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}
void hack() {printf("\n----------------------------------\n");}
int T,hackT;
int n,m,k;
ll a[N],b[N];
vector<ll> vis;
ll check(ll mid) {
ll res=0;
for(int i=1;i<=n;i++) {
ll temp=mid/a[i];
ll s=upper_bound(b+1,b+1+m,temp)-(b+1);
res+=s;
}
res=res-(upper_bound(vis.begin(),vis.end(),mid)-vis.begin());
return res;
}
void solve() {
int q;
n=read(),m=read(),k=read(),q=read();
for(int i=1;i<=n;i++) a[i]=read();
for(int i=1;i<=m;i++) b[i]=read();
for(int i=1;i<=k;i++) {
int x=read(),y=read();
vis.push_back(a[x]*b[y]);
}
sort(a+1,a+1+n);
sort(b+1,b+1+m);
sort(vis.begin(),vis.end());
while(q--) {
ll x=read();
ll l=0,r=1e12+10;
while(l<r) {
ll mid=(l+r)/2;
if(check(mid)>=x) r=mid;
else l=mid+1;
}
printf("%lld\n",l);
}
}
int main() {
// init();
// stin();
// scanf("%d",&T);
T=1;
while(T--) hackT++,solve();
return 0;
}