# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103831 | luciocf | Sure Bet (CEOI17_sure) | C++14 | 102 ms | 5120 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 = 1e5+10;
int n;
double a[maxn], b[maxn];
double s[2][maxn];
int busca(int m, bool q)
{
int ini, fim, ans = 0;
if (m > n) ini = m-n, fim = n;
else ini = 1, fim = m;
while (ini <= fim)
{
int mid = (ini+fim)>>1;
if (s[q][mid] <= s[!q][m-mid]) ans = mid, ini = mid+1;
else fim = mid-1;
}
return ans;
}
bool comp(double a, double b) {return a > b;}
int main(void)
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%lf %lf", &a[i], &b[i]);
sort(a+1, a+n+1, comp);
sort(b+1, b+n+1, comp);
for (int i = 1; i <= n; i++)
{
s[0][i] = s[0][i-1]+a[i];
s[1][i] = s[1][i-1]+b[i];
}
double ans = 0.00;
for (int i = 1; i <= 2*n; i++)
ans = max({ans, s[0][busca(i, 0)]-(double)i, s[1][busca(i, 1)]-(double)i});
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... |