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: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace C_Align
{
    public class Program

    {
        public static void Main(string[] args)
        {

            int n = ReadInt();
            List<int> line = new List<int>();
            for (int i = 0 ; i < n ; i++) line.Add(ReadInt());
            line.Sort();

            if(n % 2 == 0)
            {

                List<int> minHalf = new List<int>();
                List<int> maxHalf = new List<int>();

                //数列が偶数
                long res;
                for (int i = 0 ; i < n/2 ; i++)
                {
                    minHalf.Add(line[i]); //小さい順
                    maxHalf.Add(line[n - 1- i]); //大きい順
                }

                res = maxHalf.Sum(x => 2 * x)- minHalf.Sum(x => 2 * x) + minHalf[minHalf.Count - 1] - maxHalf[maxHalf.Count - 1];
                Console.WriteLine(res.ToString());
            }
            else
            {

                List<int> minHalf = new List<int>();
                List<int> maxHalf = new List<int>();

                //数列が奇数
                for (int i = 0 ; i < n / 2 ; i++)
                {
                    minHalf.Add(line[i]); //小さい順
                    maxHalf.Add(line[n - 1 - i]); //大きい順
                }
                minHalf.Add(line[(n - 1) / 2]);
                long res1 = maxHalf.Sum(x => 2 * x) - minHalf.Sum(x => 2 * x) + minHalf[minHalf.Count - 1] + minHalf[minHalf.Count - 2];

                minHalf.Remove(line[(n - 1) / 2]);
                maxHalf.Add(line[(n - 1) / 2]);

                long res2 = maxHalf.Sum(x => 2 * x) - minHalf.Sum(x => 2 * x) - maxHalf[maxHalf.Count - 1] - maxHalf[maxHalf.Count - 2] ;
                Console.WriteLine(Math.Max(res1,res2).ToString());

            }

        }

        static string ReadSt() { return Console.ReadLine(); }
        static int ReadInt() { return int.Parse(Console.ReadLine()); }
        static long ReadLong() { return long.Parse(Console.ReadLine()); }
        static double ReadDouble() { return double.Parse(Console.ReadLine()); }
        static string[] ReadStAr(char sep = ' ') { return Console.ReadLine().Split(sep); }
        static int[] ReadIntAr(char sep = ' ') { return Array.ConvertAll(Console.ReadLine().Split(sep), e => int.Parse(e)); }
        static long[] ReadLongAr(char sep = ' ') { return Array.ConvertAll(Console.ReadLine().Split(sep), e => long.Parse(e)); }
        static double[] ReadDoubleAr(char sep = ' ') { return Array.ConvertAll(Console.ReadLine().Split(sep), e => double.Parse(e)); }

    }

}