Problem:
Merge Sort

Write a program of a Merge Sort algorithm implemented by the following pseudocode. You should also report the number of comparisons in the Merge function.

Merge(A, left, mid, right)
n1 = mid - left;
n2 = right - mid;
create array L[0...n1], R[0...n2]
for i = 0 to n1-1
do L[i] = A[left + i]
for i = 0 to n2-1
do R[i] = A[mid + i]
L[n1] = SENTINEL
R[n2] = SENTINEL
i = 0;
j = 0;
for k = left to right-1
if L[i] <= R[j]
then A[k] = L[i]
i = i + 1
else A[k] = R[j]
j = j + 1

Merge-Sort(A, left, right){
if left+1 < right
then mid = (left + right)/2;
call Merge-Sort(A, left, mid)
call Merge-Sort(A, mid, right)
call Merge(A, left, mid, right)

Input

In the first line n is given. In the second line, n integers are given.

Output

In the first line, print the sequence S. Two consequtive elements should be separated by a space character.

In the second line, print the number of comparisons.

Constraints

n ≤ 500000

0 ≤ an element in S ≤ 109

Sample Input 1

10
8 5 9 2 6 3 7 1 10 4

Sample Output 1

1 2 3 4 5 6 7 8 9 10
34

Notes

Solution in C# (judge verdict: Accepted)

using System;
using System.Collections.Generic;

namespace ALDS1_5B
{
    class Program
    {
        static int count = 0;
        static void Merge(long[] array, int left, int mid, int right)
        {
            var n1 = mid - left;
            var n2 = right - mid;

            var l = new List<long>();
            var r = new List<long>();

            for (var n = 0; n < n1; n++)
                l.Add(array[left + n]);
           
            for (var n = 0; n < n2; n++)
                r.Add(array[mid + n]);
            
            l.Add(9999999999);
            r.Add(9999999999);

            var i = 0;
            var j = 0;

            for (var k = left; k < right; k++)
            {
                count++;
                if (l[i] <= r[j])
                {
                    array[k] = l[i];
                    i++;
                }
                else
                {
                    array[k] = r[j];
                    j++;
                }
            }
        }

        static void MergeSort(long[] array, int left, int right)
        {
            if (left + 1 < right)
            {
                var mid = (left + right) / 2;
                MergeSort(array, left, mid);
                MergeSort(array, mid, right);
                Merge(array, left, mid, right);
            }
        }

        static void Main()
        {
            var len = int.Parse(Console.ReadLine());
            var array = Array.ConvertAll(
                Console.ReadLine().Split(' '),
                e => long.Parse(e)
            );
            MergeSort(array, 0, len);
            Console.WriteLine(string.Join(" ",
                Array.ConvertAll(array, e => e.ToString())
            ) + "\n" + count.ToString());
        }
    }
}