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;
const int N = 1e5 + 5;
int n;
double a[N] , b[N];
int main()
{
// freopen(".inp","r",stdin);
// freopen(".out","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1 ; i <= n ; ++i) cin >> a[i] >> b[i];
sort(a + 1 , a + n + 1 , greater<double> {});
sort(b + 1 , b + n + 1 , greater<double> {});
double sumA = 0 , sumB = 0 , ans = 0;
int ptA = 0 , ptB = 0;
for (int i = 1 ; i <= 2 * n ; ++i)
{
if (sumA <= sumB && ptA + 1 <= n)
{
sumA += a[++ptA];
}
else
{
sumB += b[++ptB];
}
ans = max(ans , min(sumA , sumB) - i);
}
cout << fixed << setprecision(4) << 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... |