P3743 小鸟的设备

实数二分  r - l >= eps l = mid  r= mid

check函数一般就是遍历了,没必要想什么优化,就是遍历就完事了

// Problem: P3743 小鸟的设备
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P3743
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// Date: 2024-03-27 18:54:22
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
#define endl '\n'
#define int int64_t
#define ld long double
using namespace std;
int dx[] = { -1,0,1,0 };
int dy[] = { 0,1,0,-1 };
const int NC = 2e3 + 10;
char ches[NC][NC];
const int mod = 1e9 + 7;
const int N = 2e5 + 10;
int a[N], b[N], s, n, m, k;
ld eps = 1e-9, p;
bool check(ld x) {
	ld cnt = 0;
	for (int i = 1; i <= n; ++i) {
		if (b[i] - x * a[i] >= eps) continue;
		cnt += (x * a[i] - b[i]) / p;
		if (x - cnt < eps) return false;
	}
	return true;
}
void solve() {
	cin >> n >> p;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i] >> b[i];
		s += a[i];
	}
	if (p >= s) {
		cout << -1 << endl;
		return;
	}
	ld l = 0, r = 2e10;
	while (r - l >= eps) {
		ld mid = (l + r) / 2;
		if (check(mid))l = mid;
		else r = mid;
	}
	cout << l << endl;
}
signed main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int t = 1;
	//cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}