This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int n,j,j11;
double a[100005],b[100005],l,r,ans,w;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i]>>b[i];
sort(a+1,a+n+1);
sort(b+1,b+n+1);
j=n;
j11=n;
while(true)
{
w=min(l,r);
ans=max(w,ans);
if(l>=r)
{
if(j11<1)
break;
r+=b[j11]-1;
j11--;
l--;
}
else
{
if(j<1) break;
l+=a[j]-1;
j--;
r--;
}
}
printf("%.4lf",(double)ans);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |