//Jay A Patel
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define Fast ios::sync_with_stdio(0); cin.tie(0);
#define fr(a, b, c) for(int(a) = (b); (a) < (c); ++(a))
#define fre(a, b) for (auto&(a) : (b))
#define pi 3.1415926536
#define tc ll t; cin>>t; while(t--)
const ll template_array_size = 1e6 + 4265;
int a[template_array_size];
int cnt[template_array_size];
int b[template_array_size];
int n,m,h,k,mn=15000009,target,x,y,p;
const int MX = 2e5+10;
priority_queue<pair<int,int>> q;
#define diff 1e-6
int main(){
cin>>n>>p;
fr(i,1,n+1) cin>>a[i]>>b[i];
double l=0,r=1e12;
while(r-l>diff) {
double mid = (l+r)/2,need=0;
fr(i,1,n+1) {
if(b[i]>=a[i]*mid) continue;
need+=a[i]*mid-b[i];
}
if(need<=p*mid)l=mid;
else r=mid;
}
if(l>9e11)cout<<"-1"<<'\n';
else cout<<l<<'\n';
}
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |