Kasat

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
 
#define ll long long
 
using namespace std;
 
 
int main() {
    cin.sync_with_stdio(false);
    ll t, a, b, c, n;
    cin >> t;
    for (ll i = 0; i < t; ++i) {
        vector<ll> m;
        cin >> a >> b >> c >> n;
        m.push_back(a);
        m.push_back(b);
        m.push_back(c);
        sort(m.begin(), m.end());
        ll difa = m[1] - m[0];
        ll difb = m[2] - m[1];
        difa = min(difa,difb);
        if (difa > 0) {
            if (difa > n) {
                difa = n;
            }
            n -= difa;
            m[0] += difa;
            m[2] -= difa;
        }
        difa = m[2] - m[0];
        if (difa > 0) {
            if (difa > n)
                difa = n;
            if (m[0] == m[1]) {
                m[0] += difa/2;
                m[1] += difa/2;
                m[2] -= difa;
                m[1] += difa % 2;
            } else {
                m[0] += difa;
                m[1] -= difa/2;
                m[2] -= difa/2;
                m[1] -= difa % 2;
            }
            n -= difa;
        }
        for (ll j = 0; j < n; ++j) {
                m[0]++;
                m[2]--;
                sort(m.begin(), m.end());
        }
        for (ll k : m ) {
            cout << k << ' ';
        }
        cout << '\n';
    }
    return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED