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.Linq;
using System.Collections.Generic;
using System;

static class MargeSort
{
    public static int mgc;
    public static IEnumerable<T> Sort<T>(IEnumerable<T> items, Comparison<T> compare)
    {
        if (items.Count() > 1)
        {
            int m = items.Count() / 2;
            var a1 = items.Take(m).ToArray();
            var a2 = items.Skip(m).ToArray();
            return Merge(Sort(a1, compare), Sort(a2, compare), compare);
        }
        return items;
    }

    private static IEnumerable<T> Merge<T>(IEnumerable<T> a1, IEnumerable<T> a2, Comparison<T> compare)
    {
        var ite1 = a1.GetEnumerator();
        var ite2 = a2.GetEnumerator();
        var exists1 = ite1.MoveNext();
        var exists2 = ite2.MoveNext();
        while (exists1 == true && exists2 == true)
        {
            T x1 = ite1.Current;
            T x2 = ite2.Current;
            if (compare(x1, x2) < 0)
            {
                yield return x1;
                exists1 = ite1.MoveNext();
            }
            else
            {
                yield return x2;
                exists2 = ite2.MoveNext();
            }
            mgc++;
        }
        while (exists1)
        {
            mgc++;
            yield return ite1.Current;
            exists1 = ite1.MoveNext();
        }
        while (exists2)
        {
            mgc++;
            yield return ite2.Current;
            exists2 = ite2.MoveNext();
        }
    }
}

public class hello
{
    public static void Main()
    {
        var n = int.Parse(Console.ReadLine().Trim());
        string[] line = Console.ReadLine().Trim().Split(' ');
        var a = Array.ConvertAll(line, int.Parse);
        Console.WriteLine(string.Join(" ", MargeSort.Sort<int>(a, (x, y) => x - y)));
        Console.WriteLine(MargeSort.mgc);
    }
}