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;
#define fd vector<float>
int main () {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n;
cin >> n;
fd a(n);
fd b(n);
for (int i = 0; i < n; i ++)
cin >> a[i] >> b[i];
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
for (int i = 1; i < n; i ++) {
a[i] += a[i - 1];
b[i] += b[i - 1];
}
float max_outcome = -1e18;
for (int i = 0; i <= n; i ++) {
for (int j = 0; j <= n; j ++) {
max_outcome = max(max_outcome, min(i == 0 ? 0 : a[i - 1], j == 0 ? 0 : b[j - 1]) - (i + j));
}
}
printf("%.4lf", (double)max_outcome);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |