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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Linq;

namespace T1PBC2018
{
    class C
    {
        static void Main(string[] args)
        {
            //input, N, A
            int N = int.Parse(Console.ReadLine());
            int[] A = new int[N];
            for (int i = 0; i < N; i++)
            {
                A[i] = int.Parse(Console.ReadLine());
            }
            //Aを降順でソートする
            A = A.OrderByDescending(x => x).ToArray();

            if (N % 2 == 0)
            {
                long res = 0;
                for (int i = 0; i < N / 2 - 1; i++)
                {
                    res += A[i] * 2;
                }
                res += A[N / 2 - 1] * 1;
                res += A[N / 2] * -1;
                for (int i = N / 2 + 1; i < N; i++)
                {
                    res += A[i] * -2;
                }
                Console.WriteLine(res);
            }
            else
            {
                long res1 = 0;
                long res2 = 0;
                for (int i = 0; i < N / 2 - 1; i++)
                {
                    res1 += A[i] * 2;
                }
                res1 += A[N / 2 - 1] * 1;
                res1 += A[N / 2] * 1;
                for (int i = N / 2 + 1; i < N; i++)
                {
                    res1 += A[i] * -2;
                }

                for (int i = 0; i < N / 2; i++)
                {
                    res2 += A[i] * 2;
                }
                res2 += A[N / 2] * -1;
                res2 += A[N / 2 + 1] * -1;
                for (int i = N / 2 + 2; i < N; i++)
                {
                    res2 += A[i] * -2;
                }

                Console.WriteLine(Math.Max(res1, res2));

            }

        }
    }
}