Kulut

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

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

    ll i, n, avg = 0, k = 0, j, pi, pj;
    pair <ll, ll> paid[4];
    vector <pair<pair <ll, ll>, ll>> p;
    char x;
    for(i = 0; i < 4; i++)
    {
        paid[i].first = 0;
        paid[i].second = i;
    }
    cin >> n;
    while(n--)
    {
        cin >> x >> i;
        paid[x - 'A'].first += i;
        avg += i;
    }
    avg /= 4;
    /*for(i = 0; i < 4; i++)
        cout << paid[i].first << "\n";*/
    for(i = 0; i < 4; i++)
        paid[i].first = avg - paid[i].first;
    sort(paid, paid + 4);
    /*for(i = 0; i < 4; i++)
        cout << paid[i].first << "\n";*/
    i = 0, j = 3;
    while(paid[i].first == 0)
        i++;
    while(paid[j].first == 0)
        j--;
    while(i < j)
    {
        k++;
        pi = paid[i].first; pj = paid[j].first;
        p.push_back({{paid[j].second, paid[i].second}, min(abs(pi), abs(pj))});
        paid[i].first += min(abs(pi), pj);
        paid[j].first -= min(abs(pi), pj);
        //cout << paid[i].first << " " << paid[j].first << "\n";
        if(paid[i].first == 0)
            i++;
        if(paid[j].first == 0)
            j--;
    }
    cout << k << "\n";
    for(i = 0; i < k; i++)
        cout << char(p[i].first.first + 'A') << " " << char(p[i].first.second + 'A') << " " << p[i].second << "\n";

    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