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;

class Marge
{
    private int count;
    public int counting
    {
        get {
            return count;
        }
        set {
            this.count += value;
        }
    }
    public void merge(ref int[] a, 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 i1 = 0; i1 < n1; i1++) {
            l[i1] = a[left + i1];
        }
        for(int i2 = 0; i2 < n2; i2++) {
            r[i2] = a[mid + i2];
        }
        l[n1] = int.MaxValue;
        r[n2] = int.MaxValue;
        int i = 0;
        int j = 0;
        int k;
        for (k = left; k < right; k++) {
            if (l[i] <= r[j]) {
                a[k] = l[i];
                i++;
            } else {
                a[k] = r[j];
                j++;
            }
            this.counting = 1;
        }
    }
    public 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);
        }
    }
}

class B
{
    public static void Main() {
        int n = int.Parse(Console.ReadLine());
        int[] a = new int[n];
        string[] input = Console.ReadLine().Split(' ');
        for(int i = 0; i < n; i++) {
            a[i] = int.Parse(input[i]);
        }
        Marge marge = new Marge();
        marge.MergeSort(ref a, 0, a.Length);
        int c=0;
        foreach(int d in a) {
            if (c > 0) {
                Console.Write(' ');
            }
            Console.Write(d);
            c++;
        }
        Console.WriteLine();
        Console.WriteLine(marge.counting);
    }
}