#include <bits/stdc++.h>
#define double long double
using namespace std;
const double eps=0.000001;
int main(){
int n;
cin>>n;
vector<double> a(n),b(n);
for(int i=0;i<n;i++) cin>>a[i]>>b[i];
double answer=0;
vector<int> A,B;
for(int i=0;i<n;i++){
if(a[i]<1&&b[i]<1){}
else{
A.push_back(i);
B.push_back(i);
}
}
sort(A.begin(),A.end(),[&](int i,int j){
if(a[i]==a[j]) return b[i]>b[j];
return a[i]>a[j];
});
sort(B.begin(),B.end(),[&](int i,int j){
if(b[i]==b[j]) return a[i]>a[j];
return b[i]>b[j];
});
double curB=0;
n=B.size();
vector<double> p(n);
for(int i=0;i<n;i++){
curB+=b[B[i]];
p[i]=curB-i-1;
if(i) p[i]=max(p[i-1],p[i]);
}
double curA=0;
for(int i=0;i<n;i++){
curA+=a[A[i]];
double l=0,r=1+5;
while(r-l>eps){
double md=(r+l)/2;
int j=curA-i-1-md;
j=min(j,n);
if(j>=1&&p[j-1]-md>=i+1) l=md;
else r=md;
}
answer=max(answer,l);
}
setprecision(4);
cout<<fixed<<answer;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
