oj.uz

Submission #844662

# Submission time Handle Problem Language Result Execution time Memory
844662 2023-09-05T16:19:24 Z HiepVu217 Sure Bet (CEOI17_sure) C++17
0 / 100
 0 ms 2396 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 17;
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;
        ans = max (ans, fa[i] - i - z);
        z = lower_bound (fa + 1, fa + n + 1, fb[i]) - fa;
        ans = max (ans, fb[i] - i - z);
    }
    printf("%.4lf",(double) ans);
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -