Kulut

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<int, int>;

void solve() {
    int n;
    cin >> n;

    int sum = 0;
    int paid[4] = {0, 0, 0, 0};

    for (int i = 0; i < n; ++i) {
        char h;
        int x;
        cin >> h >> x;
        sum += x;
        paid[h-'A'] += x;
    }

    int goal = sum / 4;
    stack<pii> more;
    stack<pii> less;

    for (int i = 0; i < 4; ++i) {
        if (paid[i] > goal) {
            more.push({i, paid[i] - goal});
        } else if (paid[i] < goal) {
            less.push({i, goal - paid[i]});
        }
    }

    vector<string> ans;
    while (!more.empty()) {
        int change = min(more.top().second, less.top().second);
        string s;
        s.push_back(char(less.top().first+'A'));
        s += " ";
        s.push_back(char(more.top().first+'A'));
        s += " ";
        s += to_string(change);

        ans.push_back(s);

        more.top().second -= change;
        less.top().second -= change;
        if (more.top().second == 0)
            more.pop();
        if (less.top().second == 0)
            less.pop();
    }

    cout << ans.size() << '\n';
    for (string s: ans) {
        cout << s << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    //freopen("input.txt", "r", stdin);

    solve();

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED