Kasat

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

using namespace std;

int main(int argc, char** argv) {
    int t;
    long a, b, c, n;
    cin >> t;
    vector<vector<int> > v;
    vector<int> vv;
    for (int i = 0; i < t; ++i){
        cin >> a >> b >> c >> n;
        long kasat[3] = {a, b, c};
        sort(kasat, kasat+3);
        long x = n > (kasat[1] - kasat[0]) ? (kasat[1] - kasat[0]) : n;
        kasat[0] += x;
        kasat[2] -= x;
        n -= x;
        x = n > 0 ? (kasat[2] - kasat[0]) : 0;
        kasat[0] += x/2 - n%2;
        kasat[1] += x/2;
        kasat[2] -= x/2 + x/2 - n%2;
        for (int j = 0; j < 3; ++j) vv.push_back(kasat[j]);
        v.push_back(vv);
    }
    for (int i = 0; i < t; ++i){
        cout << v.at(i).at(0) << " " << v.at(i).at(1) << " " << v.at(i).at(2) << "\n";
    }
    return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER