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

import java.util.*;
public class Main {
	static Scanner sc = new Scanner(System.in);
	public static void myout(Object text){System.out.println(text);}
	public static String getStr(){return sc.next();}
	public static int getInt(){return sc.nextInt();}
	public static Long getLong(){return sc.nextLong();}
	public static boolean isNext(){return sc.hasNext();}
	public static void main(String[] args){
		//String tmp = getStr();
		//int tmp = getInt();
		//Long tmp = getLong();
      Long output = new Long(0);
      int N = getInt();
      LinkedList<Integer> list = new LinkedList<Integer>();
      LinkedList<Integer> nextList = new LinkedList<Integer>();
      for(int i = 0; i < N; i++){
        list.add(getInt());
      }
      Collections.sort(list);
      nextList.add(list.pollFirst());
      nextList.addFirst(list.pollLast());
      nextList.add(list.pollLast());
      int count = 1;
      while(list.size() != 0){
        if(count % 2 == 0){
          if(nextList.peekFirst() >= nextList.peekLast()){
            nextList.addLast(list.pollLast());
          	if(list.size() == 0){break;}
          	nextList.addFirst(list.pollLast());
          }else{
            nextList.addFirst(list.pollLast());
       		if(list.size() == 0){break;}
          	nextList.addLast(list.pollLast());
          }
        }else{
          if(nextList.peekFirst() >= nextList.peekLast()){
            nextList.addLast(list.pollFirst());
            if(list.size() == 0){break;}
            nextList.addFirst(list.pollFirst());
          }else{
            nextList.addFirst(list.pollFirst());
        	if(list.size() == 0){break;}
        	nextList.addLast(list.pollFirst());
          }
        }
        count++;
      }
      myout(nextList);
      int[] last = new int[N];
      count = 0;
      while(nextList.size() != 0){
        last[count] = nextList.pollFirst();
        count++;
      }
      for(int i = 0; i < last.length - 1; i++){
        int mae = last[i];
        int ato = last[i+1];
        output += Math.abs(mae - ato);
      }
      myout(output);
      
	}
}