# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98925 | arman_ferdous | Sure Bet (CEOI17_sure) | C++17 | 94 ms | 3684 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;
const int N = 1e5+10;
int n; double a[N], b[N];
int main() {
scanf("%d", &n);
for(int i = 0; i < n; i++)
scanf("%lf %lf", &a[i], &b[i]);
sort(a,a+n); sort(b,b+n);
int p1 = n-1, p2 = n-1;
double ans = 0, A = 0, B = 0;
for(int i = 1; i <= (n<<1); i++) {
if(p1 < 0) B += b[p2--];
else if(p2 < 0) A += a[p1--];
else if(B > A) A += a[p1--];
else B += b[p2--];
ans = max(ans, min(A - i, B - i));
} printf("%.4lf\n", ans);
return 0;
}
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... |