1,C - Invisible Hand
题意:找出最小的价格使卖家的数量大于买家的数量
难点:这题试了很多遍,一直wrong,我也不知道为啥,看别人的答案对比了半天,发现自己二分的范围取小了(哭),下次一定要注意。
AC代码
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include<algorithm>
using namespace std;
const int N = 2e5 + 10;
long long sell[N];
long long buy[N];
bool check(long long x, int n, int m);
//二分答案
int main()
{
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> sell[i];
for (int i = 1; i <= m; i++) cin >> buy[i];
long long l = 0, r = 1e9;//一定一定要注意二分的范围,取数值最大和最小的
while (l <= r) {
long long mid = l + (r - l) / 2;
if (check(mid, n, m)) r = mid - 1;//寻找更小的
else l = mid + 1;
}
if (check(l, n, m)) cout << l;
else cout << r;
return 0;
}
bool check(long long mid, int n, int m)
{
int a = 0, b = 0;
for (int i = 1; i <= n; i++) {
if (sell[i] <= mid) a++;
}
for (int i = 1; i <= m; i++) {
if (buy[i] >= mid) b++;
}
if (a >= b) return 1;
return 0;
}