洛谷P3743 kotori的设备(二分double)

2020.6.7
祝我cf div2好运，连续两把不在状态了。

代码：

#include <bits/stdc++.h>
using namespace std;
#define limit (100000 + 5)//防止溢出
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f
#define lowbit(i) i&(-i)//一步两步
#define EPS 1e-6
#define FASTIO  ios::sync_with_stdio(false);cin.tie(0);
#define ff(a) printf("%d\n",a );
#define pi(a,b) pair<a,b>
#define rep(i, a, b) for(int i = a; i <= b ; ++i)
#define per(i, a, b) for(int i = b ; i >= a ; --i)
#define mint(a,b,c) min(min(a,b), c)
#define MOD 998244353
#define FOPEN freopen("C:\\Users\\tiany\\CLionProjects\\acm_01\\data.txt", "rt", stdin)
typedef long long ll;
typedef unsigned long long ull;
ll read(){
    ll sign = 1, x = 0;char s = getchar();
    while(s > '9' || s < '0' ){if(s == '-')sign = -1;s = getchar();}
    while(s >= '0' && s <= '9'){x = x * 10 + s - '0';s = getchar();}
    return x * sign;
}//快读
void write(ll x){
    if(x < 0) putchar('-'),x = -x;
    if(x / 10) write(x / 10);
    putchar(x % 10 + '0');
}
int n , m ,k;
typedef double ld;
ld at[limit], bt[limit];
int judge(double x){
    ld tot = k * x;//总贡献
    ld sum = 0;
    rep(i ,1, n){
        ld a = at[i] , b = bt[i];
        if(a * x > b)
        sum += (a * x - b);
    }
    return sum <= tot ? 1 : 0;
}
int main() {
#ifdef LOCAL
    FOPEN;
#endif
    n = read(), k = read();
    ld sum = 0;
    rep(i ,1, n){
        ld a,b;
        scanf("%lf%lf", &a, &b);
        at[i] = a, bt[i] = b;
        sum += a;
    }
    if(sum <= k){
        return 0 * printf("-1");
    }
    ld l = 0 , r = 1e10;
    while (r - l > EPS){
        ld mid = (l + r) / 2;
        if(judge(mid)){
            l = mid;
        }else{
            r = mid;
        }
    }
    printf("%lf", (l + r) / 2);
    return 0;
}