Kasat

#include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
#define ll long long
 
int main()
{
	int t; cin >> t;
	for (int i = 0; i < t; i++) {
		ll a,b,c,n; cin >> a >> b >> c >> n;
		vector<ll> v; v.push_back(a); v.push_back(b); v.push_back(c);
		sort(v.begin(),v.end());
		while (n > 0) {
			ll t = min(v[1]-v[0],v[2]-v[1]);
			if (t == 0) {
				v[2]--;
				v[0]++;
				sort(v.begin(),v.end());
				n--;
			}
			if (n <= t) {
				v[2] -= n;
				v[0] += n;
				sort(v.begin(),v.end());
				break;
			}
			v[2] -= t;
			v[0] += t;
			sort(v.begin(),v.end());
			n -= t;
		}
		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