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.Linq;
using System.IO;
using System.Text;
using System.Collections;
using System.Collections.Generic;
 
class Program{
    static void Main(){

        int n = int.Parse(Console.ReadLine());
        int[] S = Console.ReadLine().Split(' ')
                                    .Select(val => int.Parse(val))
                                    .ToArray();
        
        Sort.MergeSort(ref S, 0, n);
        for (int i = 0; i < n; i++)
        {
            if(i != 0) Console.Write(" ");
            Console.Write(S[i]);
        }
        Console.WriteLine("\n{0}", Sort.cnt);
    }

    
}

class Sort{
    public static int cnt = 0;

    public static void Merge(ref int[] A, int left, int mid, int right){
        //Console.Error.WriteLine("left: {0}, mid: {1}, right: {2}", left, mid, right);
        int n1 = mid - left;
        int n2 = right - mid;
        //Console.Error.WriteLine("n1:{0}, n2:{1}", n1, n2);
        int[] L = new int[n1 + 1];
        Array.Copy(A, left, L, 0, n1);
        L[n1] = int.MaxValue;
        //Console.Error.WriteLine("L: {0}", string.Join(" ", L));
        int[] R = new int[n2 + 1];
        Array.Copy(A, mid, R, 0, n2);
        R[n2] = int.MaxValue;
        //Console.Error.WriteLine("R: {0}", string.Join(" ", R));
        int i = 0, j = 0;
        for (int k = left; k < right; k++)
        {
            cnt++;
            //Console.Error.WriteLine("L[i]:{0}, R[j]: {1}", L[i], R[j]);
            if(L[i] <= R[j]){
                A[k] = L[i];
                i++;
            }
            else{
                A[k] = R[j];
                j++;
            }
            //Console.Error.WriteLine("A[{0}] = {1}", k, A[k]);
        }
        //Console.Error.WriteLine(string.Join(" ", A));
    }

    public static void MergeSort(ref int[] A, int left, int right){
        if(left + 1 < right){
            int mid = (left + right) / 2;
            MergeSort(ref A, left, mid);
            MergeSort(ref A, mid, right);
            Merge(ref A, left, mid, right);
        }
    }
}