# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1027352 | vjudge1 | Sure Bet (CEOI17_sure) | C++17 | 2060 ms | 3412 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <stdio.h>
#include <algorithm>
#include <functional>
int main() {
int n; scanf("%d", &n);
double a[n], b[n];
for (int i = 0; i < n; i++) scanf("%lf %lf", &a[i], &b[i]), a[i] -= 1, b[i] -= 1;
std::sort(a, a + n, std::greater<double>());
std::sort(b, b + n, std::greater<double>());
double pa[n], pb[n];
pa[0] = a[0], pb[0] = b[0];
for (int i = 1; i < n; ++i) pa[i] = pa[i - 1] + a[i], pb[i] = pb[i - 1] + b[i];
double res = 0;
for (int na = 1; na <= n; ++na)
for (int nb = 1; nb <= n; ++nb) {
res = std::max(res, std::min(pa[na - 1] - nb, pb[nb - 1] - na));
}
printf("%.4lf", res);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |