Kulut

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> P;
#define REDIR ifstream f("input.txt"); cin.rdbuf(f.rdbuf());
int n;
int sums[4];
int main() {
    //REDIR;
    cin >> n;
    int totalsum = 0;
    for (int i = 0; i < n; i++) {
        char h; cin >> h;
        int x; cin >> x;
        sums[h-'A'] += x;
        totalsum += x;
    }
    int need = totalsum / 4;
    vector<pair<int,pair<int,int>>> v;
    while (true) {
        bool cont = false;
        for (int i = 0; i < 4; i++) {
            if (sums[i] < need) {
                cont = true;
                for (int j = 0; j < 4; j++) {
                    if (sums[j] > need) {
                        
                        int extra = min(sums[j] - need, need-sums[i]);
                        //cout << sums[i] << " " << sums[j] << " " << extra << endl;
                        sums[i] += extra;
                        sums[j] -= extra;
                        v.push_back({i, {j, extra}});
                        break;
                    }
                }
            }
        }
        if (!cont) break;
    }
    cout << v.size() << endl;
    for (pair<int,P> k : v) {
        cout << (char)(k.first+'A') << " " << (char)(k.second.first + 'A') << " " << k.second.second << endl;
    }
}

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