Submission #1273404

#	Time	Username	Problem	Language	Result	Execution time	Memory
1273404		AksLolCoding	Sure Bet (CEOI17_sure)	C++17	100 / 100	46 ms	2004 KiB

sure

#include <bits/stdc++.h>
using namespace std;
using ld = double;

void solve() {
    int n;
    cin >> n;
    vector<ld> a(n), b(n);
    for (int i = 0; i < n; i++) cin >> a[i] >> b[i];

    // solve
    sort(a.rbegin(), a.rend());
    sort(b.rbegin(), b.rend());
    int ap = 0, bp = 0;
    ld as = 0, bs = 0, ans = 0;
    for (int i = 0; i < 2*n; i++) {
        if (as < bs) {
            if (ap == n) break;
            as += a[ap++];
        } else {
            if (bp == n) break;
            bs += b[bp++];
        }
        ans = max(ans, min(as, bs) - i - 1);
    }
    cout << fixed << setprecision(4) << ans << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    solve();
}

• Subtask 1: 20 / 20
• Subtask 2: 40 / 40
• Subtask 3: 40 / 40