Kasat

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;

int main(){
    int t;
    cin >> t;
    for(int i=0; i<t; ++i){
        vector<int> v;
        v.resize(3);
        int n;
        cin >> v[0] >> v[1] >> v[2] >>n;
        for(int j=0; j<n; ++j){
            sort(v.begin(), v.end());
            --v[2];
            ++v[0];
        }sort(v.begin(), v.end());
        cout << v[0] << " " << v[1] << " " << v[2] <<"\n";
    }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED