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>
#define fi first
#define se second
using namespace std;
const int N = 2e6+7;
int n;
double a[N], b[N], prefixSumA[N], prefixSumB[N], res = 0;
int main()
{
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i]>>b[i];
sort(a+1,a+1+n,greater<double>());
sort(b+1,b+1+n,greater<double>());
for(int i=1;i<=n;i++) {
prefixSumA[i] = prefixSumA[i-1] + a[i];
prefixSumB[i] = prefixSumB[i-1] + b[i];
}
for(int i=1;i<=2*n;i++) {
for(int j=0;j<=i;j++) {
double va1 = prefixSumA[j];
double va2 = prefixSumB[i-j];
res = max(res, min(va1 - i, va2 - i));
}
}
printf("%.4lf",(double)res);
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... |