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;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Text.RegularExpressions;
using System.Threading.Tasks;
using static System.Math;

public static class P
{
    static int Res = 0;
    public static void Main()
    {
        int n = int.Parse(Console.ReadLine());
        var a = Console.ReadLine().Split().Select(int.Parse).ToArray();
        MergeSort(a, 0, a.Length);
        Console.WriteLine(string.Join(" ", a));
        Console.WriteLine(Res);
    }
    static void MergeSort(int[] a, int left, int right)
    {
        if (left + 1 >= right) return;
        var mid = (left + right) / 2;
        MergeSort(a, left, mid);
        MergeSort(a, mid, right);
        Merge(a, left, mid, right);
    }
    static void Merge(int[] a, int left, int mid, int right)
    {
        int n1 = mid - left;
        int n2 = right - mid;
        var L = new int[n1 + 1];
        var R = new int[n2 + 1];
        for (int i = 0; i < n1; i++)
        {
            L[i] = a[left + i];
        }
        for (int i = 0; i < n2; i++)
        {
            R[i] = a[mid + i];
        }
        L[n1] = int.MaxValue / 2;
        R[n2] = int.MaxValue / 2;
        int lind = 0;
        int rind = 0;
        for (int i = left; i < right; i++)
        {
            a[i] = L[lind] <= R[rind] ? L[lind++] : R[rind++];
            Res++;
        }
    }
}