# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56085 | gabrielsimoes | Sure Bet (CEOI17_sure) | C++17 | 2073 ms | 600 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.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5+10;
int n;
vector<double> va, vb;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
double a, b;
scanf("%lf %lf", &a, &b);
va.push_back(a);
vb.push_back(b);
}
sort(va.rbegin(), va.rend());
sort(vb.rbegin(), vb.rend());
for (int i = 1; i < n; i++) {
va[i] += va[i-1];
vb[i] += vb[i-1];
}
va.insert(va.begin(), 0);
vb.insert(vb.begin(), 0);
double ans = 0;
for (int i = 0; i <= n; i++) {
int l = 0, r = n;
while (r - l > 100) {
int m1 = l + (l + r)/3;
int m2 = l + 2 * ((l + r)/3);
double v1 = min(va[i] - (i + m1), vb[m1] - (i + m1));
double v2 = min(va[i] - (i + m2), vb[m2] - (i + m2));
if (v1 > v2) r = m2-1;
else l = m1+1;
}
for (int k = l; k <= r; k++) {
ans = max(ans, min(va[i] - (i+k), vb[k] - (i+k)));
}
}
printf("%.4lf\n", ans);
}
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... |