2020 CCPC Wannafly Winter Camp Day1 Div.1&2F题解

https://ac.nowcoder.com/acm/contest/3979/F

首先可以想到的是二分来求解。
将a,b数组各分成3部分，正数负数与零分别进行讨论。

#include<bits/stdc++.h>
//#pragma GCC optimize(2)
#include<iostream>
#include<stdio.h>
#include<string>
#include<cstring>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#define ll long long

using namespace std;
const ll N = 1000000;
const ll inf = 1e12 + 5000;
ll ans = 1e13, n, m, k, al, bl;//
vector<ll>az, af, bz, bf;//分四部分存储
bool cheak(ll x)
{
	ll sumx = 0;
	if (x < 0)
	{
		for (int i = 0; i < af.size(); ++i) 
		{
			ll fg = x / af[i];
			if (fg % af[i] != 0) fg++;
			sumx +=  upper_bound(bz.begin(), bz.end(), fg)-bz.begin();
		}
		for (int i = 0; i < bf.size(); ++i) 
		{
			ll fg = x / af[i];
			if (fg % af[i] != 0) fg++;
			sumx += upper_bound(az.begin(), az.end(), fg) - az.begin();
		}
	}
	else if (x == 0)
	{
		sumx += (ll)af.size() * (ll)bz.size() + (ll)az.size() * (ll)bf.size();
		sumx += bl * (ll)(af.size() + az.size()) + al * (ll)(bf.size() + bz.size()) + al * bl;
	}
	else
	{
		sumx += (ll)af.size() * (ll)bz.size() + (ll)az.size() * (ll)bf.size();
		sumx += bl * (ll)(af.size() + az.size()) + al * (ll)(bf.size() + bz.size()) + al * bl;
		for (int i = 0; i < af.size(); ++i) 
		{
			ll t = x / az[i];
			if (t == 0) continue;
			sumx += upper_bound(bf.begin(), bf.end(), t) - bf.begin();
		}
		for (int i = 0; i < az.size(); ++i)
		{
			ll t = x / az[i];
			if (t == 0) continue;
			sumx += upper_bound(bz.begin(), bz.end(), t) - bz.begin();
		}
	}
	return sumx >= k;
}
int main()
{
	//ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
	freopen("182.txt", "r", stdin);
#endif // ONLINE_JUDGE
	scanf("%lld%lld%lld", &n, &m, &k);
	for (int i = 1; i <= n; i++)
	{
		ll t;
		scanf("%lld", &t);
		if (t > 0)az.push_back(t);
		else if (t == 0)al++;
		else
			af.push_back(t);
	}
	for (int i = 1; i <= m; i++)
	{
		ll t;
		scanf("%lld", &t);
		if (t > 0)bz.push_back(t);
		else if (t == 0)bl++;
		else
			bf.push_back(t);
	}
	sort(az.begin(), az.end());
	sort(bz.begin(), bz.end());
	sort(af.begin(), af.end());
	sort(bf.begin(), bf.end());
	k = n * m - k + 1;//第k小
	ll l = -inf, r = inf;
	while (l <= r)
	{
		ll mid = (l + r) >> 1;
		if (cheak(mid))//比mid小等于的数大于k;
		{
			r = mid - 1;
			ans = mid;
		}
		else
			l = mid + 1;
	}
	cout << ans;
	return 0;
}