# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303024 | Kenzo_1114 | Sure Bet (CEOI17_sure) | C++17 | 1 ms | 256 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 MAXN = 100010;
int n;
double a[MAXN], b[MAXN], A, B;
int main ()
{
scanf("%d", &n);
for(int i = 0; i < n; i++)
{
scanf("%lf %lf", &A, &B);
a[i] = A; b[i] = B;
}
sort(a, a + n);
sort(b, b + n);
int ida = n - 1, idb = n - 1;
double ans = (int) 0, sa = (int) 0, sb = (int) 0;
for(int i = 0; i < n; i++)
{
if(sa >= sb && 0 <= idb) sb += b[idb], idb--;
else if(sa < sb && 0 <= ida) sa += a[ida], ida--;
ans = max(ans, min(sa, sb) - i - 1);
}
printf("%.4lf\n", ans);
}
/*
4
1.4 3.7
1.2 2
1.6 1.4
1.9 1.5
*/
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... |