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;
double a[1002];
double b[1002];
double sum_a[1002];
double sum_b[1002];
bool cmp(double x, double y){
return x > y;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for(int i=0;i<n;i++){
cin >> a[i] >> b[i];
}
sort(a, a+n, cmp);
sort(b, b+n, cmp);
double ans = 0;
sum_a[0] = 0, sum_b[0] = 0;
for(int i=1;i<=n;i++){
sum_a[i] = sum_a[i-1] + a[i-1];
sum_b[i] = sum_b[i-1] + b[i-1];
}
for(int m = 1;m<=2*n;m++){
for(int k=max(0, m-n);k<=min(m, n);k++){
ans = max(ans, min(sum_a[k] - m, sum_b[m-k] - m));
}
}
printf("%.4lf", 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... |