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;
					
public class Program
{
	public static int comp = 0;
	public static void Main()
	{
		int n = int.Parse(Console.ReadLine());
		int[] ls = Array.ConvertAll(Console.ReadLine().Trim().Split(' '), int.Parse);
		mergeSort(ls, 0, n);
		Console.WriteLine(string.Join(" ", ls));
		Console.WriteLine(comp);
	}
	public static void mergeSort(int[] ls, int left, int right){
		if (left + 1 < right){
			int mid = (left + right)/2;
			mergeSort(ls, left, mid);
			mergeSort(ls, mid, right);
			merge(ls, left, mid, right);
		}
	} 
	public static void merge(int[] ls, int left, int mid, int right){
		int n1 = mid - left, n2 = right - mid;
		int[] L = new int[n1 + 1], R = new int[n2 + 1];
		for(int i = 0; i < n1; i++) L[i] = ls[left + i];
		for(int i = 0; i < n2; i++) R[i] = ls[mid + i];
		L[n1] = int.MaxValue; R[n2] = int.MaxValue;
		for(int k = left, i = 0, j = 0; k < right; k++) 
			if (L[i] < R[j]){
				ls[k] = L[i++];
				comp++;
			}
			else{
				ls[k] = R[j++];
				comp++;
			}
	}
}