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;
using System.Text;

class Program
{
    public void Proc()
    {
        int itemCount = int.Parse(Console.ReadLine());
        int[] items = new int[itemCount];
        string[] inpt = Console.ReadLine().Split(' ');
        for(int i=0; i<itemCount; i++)
        {
            items[i] = int.Parse(inpt[i]);
        }

        this.MargeSort(items, 0, itemCount);

        StringBuilder ans = new StringBuilder();
        foreach(int item in items)
        {
            if(ans.Length > 0)
            {
                ans.Append(" ");
            }
            ans.Append(item);
        }
        Console.WriteLine(ans.ToString());
        Console.WriteLine(this.ProcCnt);
    }

    private int ProcCnt = 0;
    private void Marge(int[] array, int left, int mid, int right)
    {
        int n1 = mid - left;
        int n2 = right - mid;

        int[] l = new int[n1 + 1];
        int[] r = new int[n2 + 1];

        for(int i= 0; i< n1; i++)
        {
            l[i] = array[left + i];
        }
        for(int i=0; i< n2; i++)
        {
            r[i] = array[mid + i];
        }
        l[n1] = int.MaxValue;
        r[n2] = int.MaxValue;

        int idx1 = 0;
        int idx2 = 0;
        for(int i= left; i< right; i++)
        {
            if(l[idx1] <= r[idx2])
            {
                array[i] = l[idx1];
                idx1++;
            } else
            {
                array[i] = r[idx2];
                idx2++;
            }
            this.ProcCnt++;
        }
    }

    private void MargeSort(int[] array, int left, int right)
    {
        if(left + 1 < right)
        {
            int mid = (left + right) / 2;
            MargeSort(array, left, mid);
            MargeSort(array, mid, right);
            Marge(array, left, mid, right);
        }
    }

    static void Main(string[] args)

    {

        Program prg = new Program();
        prg.Proc();

    }
}