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 main() {
int n;
cin>>n;
vector<double> v1,v2;
for(int i=0;i<n;i++) {
double a,b;
cin>>a>>b;
v1.push_back(a);
v2.push_back(b);
}
sort(v1.begin(),v1.end(),greater<double>());
sort(v2.begin(),v2.end(),greater<double>());
double s1[n],s2[n];
s1[0]=v1[0];
s2[0]=v2[0];
for(int i=1;i<n;i++) {
s1[i]=s1[i-1]+v1[i];
s2[i]=s2[i-1]+v2[i];
}
double res=0;
int ptr=0;
for(int i=0;i<n;i++) {
while(ptr+1<n && s1[i]>s2[ptr]) {
int t=i+ptr+2;
res=max(res,min(s1[i],s2[ptr])-t);
ptr++;
}
int t=i+ptr+2;
res=max(res,min(s1[i],s2[ptr])-t);
}
cout<<fixed<<setprecision(4);
cout<<res<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |