Codeforces Round #409 div2 C

C. Voltage Keepsake

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You have n devices that you want to use simultaneously.

The i-th device uses ai units of power per second. This usage is continuous. That is, in λ seconds, the device will use λ·ai units of power. The i-th device currently has bi units of power stored. All devices can store an arbitrary amount of power.

You have a single charger that can plug to any single device. The charger will add p units of power per second to a device. This charging is continuous. That is, if you plug in a device for λ seconds, it will gain λ·p units of power. You can switch which device is charging at any arbitrary unit of time (including real numbers), and the time it takes to switch is negligible.

You are wondering, what is the maximum amount of time you can use the devices until one of them hits 0 units of power.

If you can use the devices indefinitely, print -1. Otherwise, print the maximum amount of time before any one device hits 0 power.

Input

The first line contains two integers, n and p (1 ≤ n ≤ 100 000, 1 ≤ p ≤ 109) — the number of devices and the power of the charger.

This is followed by n lines which contain two integers each. Line i contains the integers ai and bi (1 ≤ ai, bi ≤ 100 000) — the power of the device and the amount of power stored in the device in the beginning.

Output

If you can use the devices indefinitely, print -1. Otherwise, print the maximum amount of time before any one device hits 0 power.

Your answer will be considered correct if its absolute or relative error does not exceed 10 - 4.

Namely, let's assume that your answer is a and the answer of the jury is b. The checker program will consider your answer correct if .

Examples

input

2 1
2 2
2 1000

output

2.0000000000

input

1 100
1 1

output

-1

input

3 5
4 3
5 2
6 1

output

0.5000000000

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
using namespace std;
#define maxn 120009
#define inf 0x3f3f3f3f
struct node{
    int a;
    int b;
}a[maxn];
int n;
double p;
int fun(double x){
    double sum=0;
    for(int i = 0 ; i<n ; i++){
        double ans=a[i].a*x-a[i].b;
        if(ans<=0)
            ans=0;
        sum+=ans;
    }
    if(sum>=x*p)
        return 0;
    return 1;
}
int main(){
    scanf("%d%lf",&n,&p);
    double sum=0;
    for(int i = 0 ; i<n ; i++){
        scanf("%d%d",&a[i].a,&a[i].b);
        sum+=a[i].a;
    }
    if(sum<=p){
        printf("-1");
        return 0;
    }
    double r=1e19;
    double l=0,mid;
    sum=0;
    while(sum<400){
        mid=(l+r)/2;
        if(fun(mid)){
            l=mid;
        }
        else{
            r=mid;
        }
        sum++;
    }
    printf("%lf",l);
}

这个题 数据很大  fun 函数判断时 sum 不能直接直接加 否则会迷之wa

另外 可以直接判断是否输出-1 不过 一定要注意数据是否会爆

wa了太多次了 标准二分题啊