Kulut

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

typedef long long ll;

ll n;
ll a, b, c, d;
ll k, s;
vector<pair<ll,char>> v;

bool balance(){
    bool b = true;
    for (int i = 0; i < 4; i++){
        if(v[i].first != s) b = false;
    }
    return b;
}

int main (){
    cin >> n;
    v.resize(4);
    a = 0; b = 0; c = 0; d = 0;

    for(int i = 0; i < n; i++){
        char c;
        int x;
        cin >> c >> x;
        if(c == 'A') a += x;
        if(c == 'B') b += x;
        if(c == 'C') c += x;
        if(c == 'v') d += x;
    }
    
    v[0].first = a;
    v[0].second = 'A';
    v[1].first = b;
    v[1].second = 'B';
    v[2].first = c;
    v[2].second = 'C';
    v[3].first = d;
    v[3].second = 'D';

    k = a + b + c + d;
    s = k / 4;

    bool check = balance();

    while(!check){
        sort(v.begin(), v.end());
        cout << v[3].second << " " << v[0].second << " " << v[3].first - s << "\n";
        v[0].first += v[3].first - s;
        v[3].first -= v[3].first - s; 
        check = balance();
    }
    
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: TIME LIMIT EXCEEDED