Submission #1222262

#	Time	Username	Problem	Language	Result	Execution time	Memory
1222262		overwatch9	Bikeparking (EGOI24_bikeparking)	C++20	9 / 100	226 ms	37984 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    int n;
    cin >> n;
    set <pair <ll, ll>> X, Y;
    for (int i = 0; i < n; i++) {
        int tp;
        cin >> tp;
        X.insert({i, tp});
    }
    for (int i = 0; i < n; i++) {
        int tp;
        cin >> tp;
        Y.insert({tp, -i});
    }

    ll ans = 0;

    set <pair <ll, ll>> todo;

    for (int i = 0; i < n; i++) {
        int y = Y.rbegin()->first;
        int id = -Y.rbegin()->second;
        Y.erase(--Y.end());
        while (y > 0) {
            auto it = X.lower_bound({id, 0});
            if (it == X.begin()) {
                if (y == 0)
                    break;
                todo.insert({y, -id});
                break;
            }

            it--;
            int x = it->second;
            int id2 = it->first;
            X.erase(it);
            int amt = min(x, y);
            ans += amt;
            x -= amt;
            y -= amt;

            if (x > 0) {
                X.insert({id2, x});
                // y = 0
                break;
            }

        }

    }

    for (auto i : todo) {
        int y = i.first;
        int id = i.second;
        auto it = X.lower_bound({id, 0});
        if (it->first != id)
            ans -= y;
    }

    cout << ans << '\n';

}

• Subtask 1: 0 / 16
• Subtask 2: 9 / 9
• Subtask 3: 0 / 19
• Subtask 4: 0 / 24
• Subtask 5: 0 / 32