oj.uz

Submission #856391

# Submission time Handle Problem Language Result Execution time Memory
856391 2023-10-03T11:06:30 Z HiepVu217 Sure Bet (CEOI17_sure) C++17
100 / 100
 94 ms 6736 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 17;
long double ans, a[N], b[N], fa[N], fb[N];
int n, z;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
    sort (a + 1, a + n + 1);
    sort (b + 1, b + n + 1);
    for (int i = n; i >= 1; i--)
    {
        fa[n - i + 1] = fa[n - i] + a[i];
        fb[n - i + 1] = fb[n - i] + b[i];
    }
    for (int i = 1; i <= n; i++)
    {
        z = lower_bound (fb + 1, fb + n + 1, fa[i]) - fb;
        if (z <= n)
        {
            ans = max (ans, fa[i] - i - z);
        }
        z = lower_bound (fa + 1, fa + n + 1, fb[i]) - fa;
        if (z <= n)
        {
            ans = max (ans, fb[i] - i - z);
        }
    }
    printf("%.4lf",(double) ans);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2548 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2544 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2548 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2544 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 84 ms 6524 KB Output is correct
18 Correct 85 ms 6580 KB Output is correct
19 Correct 88 ms 6484 KB Output is correct
20 Correct 81 ms 6484 KB Output is correct
21 Correct 94 ms 6736 KB Output is correct
22 Correct 86 ms 6484 KB Output is correct
23 Correct 84 ms 6480 KB Output is correct
24 Correct 84 ms 6484 KB Output is correct
25 Correct 84 ms 6704 KB Output is correct
26 Correct 87 ms 6480 KB Output is correct