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.Linq;
using static System.Console;
using static System.Convert;
using static System.Math;

class Program
{
    private static int count = 0;
    static void Main(string[] args)
    {
        var num = ToInt32(ReadLine());
        var ar = Array.ConvertAll(ReadLine().Split(' '), int.Parse);
        MergeSort(ar, 0, ar.Length);
        WriteLine($"{string.Join(" ", ar)}\n{count}");
    }
    private static void MergeSort(int[] ar,int left,int right)
    {
        if (right <= left + 1) return;
        var mid = (right + left) / 2;
        MergeSort(ar, left, mid);
        MergeSort(ar, mid, right);
        Merge(ar, left, mid, right);
    }
    private static void Merge(int[] ar,int left,int mid,int right)
    {
        var num1 = mid - left;
        var num2 = right - mid;
        var le = new int[num1 + 1];
        var ri = new int[num2 + 1];
        for (var i = 0; i < num1; i++)
            le[i] = ar[left+i];
        for (var i = 0; i < num2; i++)
            ri[i] = ar[mid + i];
        le[num1] = int.MaxValue;
        ri[num2] = int.MaxValue;
        var ii = 0;
        var jj = 0;
        for(var k = left; k < right; k++)
        {
            if (le[ii] <= ri[jj])
            {
                ar[k] = le[ii];
                ii++;
            }
            else
            {
                ar[k] = ri[jj];
                jj++;
            }
            count++;
        }
    }
    private const string ALFA = "abcdefghijklmnopqrstuvwxyz";
    private const int MOD = 1000000007;
}