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 Java7 (OpenJDK 1.7.0) (judge verdict: Runtime Error)


import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int n;
		int a[], b[];

		n = sc.nextInt();

		a = new int[n];
		b = new int[n];

		for (int i = 0; i < n; ++i) {
			a[i] = sc.nextInt();
		}
		int min = 0;
		for (int i = 0; i < n; ++i) {
			min = i;
			for (int j = i + 1; j < n; ++j) {
				if (a[min] > a[j])
					min = j;
			}
			if (min != i) {
				int tmp = a[i];
				a[i] = a[min];
				a[min] = tmp;
			}
		}
		for (int i = 0; i < n; ++i) {
			if (2 * (i + 1) < n) {
				b[i] = a[2 * (i + 1)];
			} else if (2 * (i + 1) < n + 2) {
				b[i] = a[0];
			} else {
				b[i] = a[2 * (n - i) - 1];
			}
		}

		if (n % 2 == 0) {
			int tmp = b[n / 2 + 1];
			b[n / 2 + 1] = b[n - 1];
			b[n - 1] = tmp;
		}

		int sum = 0;
		for (int i = 0; i < n - 1; ++i) {
			sum += Math.abs(b[i] - b[i + 1]);
		}

		System.out.println(sum);
		sc.close();
	}

}