二分答案,先排一下序,再扫,同时搞一个指针倒着扫,计算比当前数小的数的个数,判断
蜜汁WA
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long k;
int n,m;
int num1[200001],num2[200001];
int check(long long t)
{
long long tot=0;
int p=m;
for(int i=1;i<=n;i++)
{
while(1ll*num1[i]*num2[p]>t&&p) p--;
tot+=p;
}
if(tot>=k) return 1;
else return 0;
}
int main()
{
freopen("number.in","r",stdin);
freopen("number.out","w",stdout);
cin>>n>>m;
scanf("%lld",&k);
for(int i=1;i<=n;i++)
scanf("%d",&num1[i]);
for(int i=1;i<=m;i++)
scanf("%d",&num2[i]);
sort(num1+1,num1+n+1);
sort(num2+1,num2+m+1);
long long ans,mid,l=0,r=1ll*num1[n]*num2[m]+8;
while(l<=r)
{
mid=(l+r)/2;
if(check(mid))
ans=mid,r=mid-1;
else l=mid+1;
}
cout<<ans;
return 0;
}