Codeforces Round #568 (Div. 2)A. Ropewalkers

Polycarp decided to relax on his weekend and visited to the performance of famous ropewalkers: Agafon, Boniface and Konrad.

The rope is straight and infinite in both directions. At the beginning of the performance, Agafon, Boniface and Konrad are located in positions a, b and c respectively. At the end of the performance, the distance between each pair of ropewalkers was at least d.

Ropewalkers can walk on the rope. In one second, only one ropewalker can change his position. Every ropewalker can change his position exactly by 1 (i. e. shift by 1 to the left or right direction on the rope). Agafon, Boniface and Konrad can not move at the same time (Only one of them can move at each moment). Ropewalkers can be at the same positions at the same time and can “walk past each other”.

You should find the minimum duration (in seconds) of the performance. In other words, find the minimum number of seconds needed so that the distance between each pair of ropewalkers can be greater or equal to d.

Input
The only line of the input contains four integers a, b, c, d (1≤a,b,c,d≤109). It is possible that any two (or all three) ropewalkers are in the same position at the beginning of the performance.

Output
Output one integer — the minimum duration (in seconds) of the performance.

Examples
inputCopy
5 2 6 3
outputCopy
2
inputCopy
3 1 5 6
outputCopy
8
inputCopy
8 3 3 2
outputCopy
2
inputCopy
2 3 10 4
outputCopy
3
Note
In the first example: in the first two seconds Konrad moves for 2 positions to the right (to the position 8), while Agafon and Boniface stay at their positions. Thus, the distance between Agafon and Boniface will be |5−2|=3, the distance between Boniface and Konrad will be |2−8|=6 and the distance between Agafon and Konrad will be |5−8|=3. Therefore, all three pairwise distances will be at least d=3, so the performance could be finished within 2 seconds.

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<string>
#define ll long long
#define dd double
dd PI = acos(-1);
using namespace std;
int main() {
	ll a[5];
	cin >> a[0] >> a[1] >> a[2];
	ll k; cin >> k;
	sort(a, a + 3);
	ll t1 = a[1] - a[0];
	ll tt1 = k - t1;
	ll sum = 0;
	if (tt1 > 0) {
		sum += tt1;
	}
	ll t2 = a[2] - a[1];
	ll tt2 = k - t2;
	if (tt2 > 0) {
		sum += tt2;
	}
	cout << sum << endl;
}