Codeforces 772A Voltage Keepsake - 二分答案

You have n devices that you want to use simultaneously.

The i-th device uses a_i units of power per second. This usage is continuous. That is, in λ seconds, the device will use λ·a_i units of power. The i-th device currently has b_i 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 ≤ 10⁹) — 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 a_i and b_i (1 ≤ a_i, b_i ≤ 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

Note

In sample test 1, you can charge the first device for the entire time until it hits zero power. The second device has enough power to last this time without being charged.

In sample test 2, you can use the device indefinitely.

In sample test 3, we can charge the third device for 2 / 5 of a second, then switch to charge the second device for a 1 / 10 of a second

---

　　二分答案，然后判断所有需要充电的需要充的电是否大于等于充电总量。

　　注意初值和控制一下二分的次数。

Code

  1 /**
  2  * Codeforces
  3  * Problem#772A
  4  * Accepted
  5  * Time:61ms
  6  * Memory:2836k
  7  */
  8 #include <iostream>
  9 #include <cstdio>
 10 #include <ctime>
 11 #include <cmath>
 12 #include <cctype>
 13 #include <cstring>
 14 #include <cstdlib>
 15 #include <fstream>
 16 #include <sstream>
 17 #include <algorithm>
 18 #include <map>
 19 #include <set>
 20 #include <stack>
 21 #include <queue>
 22 #include <vector>
 23 #include <stack>
 24 #ifndef WIN32
 25 #define Auto "%lld"
 26 #else
 27 #define Auto "%I64d"
 28 #endif
 29 using namespace std;
 30 typedef bool boolean;
 31 const signed int inf = (signed)((1u << 31) - 1);
 32 const double eps = 1e-6;
 33 const int binary_limit = 128;
 34 #define smin(a, b) a = min(a, b)
 35 #define smax(a, b) a = max(a, b)
 36 #define max3(a, b, c) max(a, max(b, c))
 37 #define min3(a, b, c) min(a, min(b, c))
 38 template<typename T>
 39 inline boolean readInteger(T& u){
 40     char x;
 41     int aFlag = 1;
 42     while(!isdigit((x = getchar())) && x != '-' && x != -1);
 43     if(x == -1) {
 44         ungetc(x, stdin);    
 45         return false;
 46     }
 47     if(x == '-'){
 48         x = getchar();
 49         aFlag = -1;
 50     }
 51     for(u = x - '0'; isdigit((x = getchar())); u = (u << 1) + (u << 3) + x - '0');
 52     ungetc(x, stdin);
 53     u *= aFlag;
 54     return true;
 55 }
 56 
 57 inline int dcmp(double a, double b) {
 58     if(fabs(a - b) < eps)    return 0;
 59     if(a - b < 0)    return -1;
 60     return 1;
 61 }
 62 
 63 int n, p;
 64 int *a, *b; 
 65 long long s = 0;
 66 
 67 inline void init() {
 68     readInteger(n);
 69     readInteger(p);
 70     a = new int[n + 1];
 71     b = new int[n + 1];
 72     for(int i = 1; i <= n; i++) {
 73         readInteger(a[i]);
 74         readInteger(b[i]);
 75         s += a[i];
 76     }
 77 }
 78 
 79 boolean check(double mid) {
 80     double cost = 0.0;
 81     for(int i = 1; i <= n; i++)
 82         if(a[i] * mid >= b[i])
 83             cost += a[i] * mid - b[i];
 84     return cost < p * mid;
 85 }
 86 
 87 inline void solve() {
 88     if(s <= p) {
 89         puts("-1");
 90         return;
 91     }
 92     double l = 0, r = 1e16;
 93     int times = 0;
 94     while(dcmp(l, r) == -1 && times < binary_limit) {
 95         double mid = (l + r) / 2;
 96         times++;
 97         if(check(mid))    l = mid;
 98         else r = mid;
 99     }
100     printf("%.6lf", l);
101 }
102 
103 int main() {
104     init();
105     solve();
106     return 0;
107 }

 

转载于:https://www.cnblogs.com/yyf0309/p/7143600.html