Problem:
Score : 400 points

Problem Statement

You are given N integers; the i-th of them is A_i.
Find the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order you like.

Constraints

2 \leq N \leq 10^5

1 \leq A_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1
:
A_N

Output

Print the maximum possible sum of the absolute differences between the adjacent elements after arranging the given integers in a row in any order you like.

Sample Input 1

5
6
8
1
2
3

Sample Output 1

21

When the integers are arranged as 3,8,1,6,2, the sum of the absolute differences between the adjacent elements is |3 - 8| + |8 - 1| + |1 - 6| + |6 - 2| = 21. This is the maximum possible sum.

Sample Input 2

6
3
1
4
1
5
9

Sample Output 2

25

Sample Input 3

3
5
5
1

Sample Output 3

8

Solution in PHP7 (7.0.15) (judge verdict: Accepted)

<?php
fscanf(STDIN, "%d", $N);

$array = array();
$rar = array();
$result = 0;
$temp = 0;
for ($i=1; $i <= $N; $i++) { 
	 array_push($array, trim(fgets(STDIN)));
}
sort($array, SORT_NUMERIC );
if ($N % 2 == 0) {
	for ($j=0; $j < $N / 2; $j++) { 
		$rar[$j*2+1]=$array[$j];
		$rar[$j*2]=$array[$j+$N/2];
	}
}else{
	$center = $N/2;
	$rar[$center]=$array[0];
	for ($m=1; $m <= $N / 2; $m++) { 
		if ($m % 2==1) {
			$rar[$center-$m]=$array[$N-$m];
			$rar[$center+$m]=$array[$N-$m-1];
		}else{
			$rar[$center-$m]=$array[$m-1];
			$rar[$center+$m]=$array[$m];
		}
	}
	for ($k=0; $k < $N-1 ; $k++) { 
		$temp+=abs($rar[$k]-$rar[$k+1]);
	}
	$rar[$center]=$array[$N-1];
	for ($m=1; $m <= $N / 2; $m++) { 
		if ($m % 2==0) {
			$rar[$center-$m]=$array[$N-$m];
			$rar[$center+$m]=$array[$N-$m-1];
		}else{
			$rar[$center-$m]=$array[$m-1];
			$rar[$center+$m]=$array[$m];
		}
	}
}

for ($k=0; $k < $N-1 ; $k++) { 
	$result+=abs($rar[$k]-$rar[$k+1]);
}
echo ($result<$temp)?$temp:$result;