Jakkara

#include <iostream>
#include <algorithm>

using namespace std;

int main() {

	int legs[4];
	int mn=2147483647,mx=-1;
	for(int i=0;i<4;i++) {
		cin >> legs[i];
		mx = max(mx, legs[i]);
		mn = min(mn, legs[i]);
	}

	int mm=2147483647;
	for(int t=mn;t<=mx;t++) {
		int s=0;
		for(int i=0;i<4;i++) {
			s+=abs(t-legs[i]);
		}
		mm = min(mm, s);
	}

	cout << mm;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED