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: Wrong Answer)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace aizu1
{
    public class Solution
    {
        public static void Main(string[] args)
        {
            Console.ReadLine();
            int[] s = Array.ConvertAll<string, int>(Console.ReadLine().Split(' '),int.Parse);
            int comCount = mergeSort(s, 0, s.Length-1);
            string res = string.Join(" ", Array.ConvertAll<int, string>(s,(i)=>i.ToString()));

            Console.WriteLine(res);
            Console.WriteLine(comCount+1);
        }

        public static int mergeSort(int[] list, int left, int right)
        {
            if (left == right) return 0;
            if (left == right - 1)
            {
                int l = list[left];
                int r = list[right];
                list[left] = l < r ? l : r;
                list[right] = l <= r ? r : l;
                return 1;
            }

            return mergeSort(list, left, (right+left)/2-1)+mergeSort(list,(right+left)/2,right)+merge(list,left,(left+right)/2,right); 
        }

        public static int merge(int[] list, int left, int mid, int right)
        {
            int[] L = new int[mid - left+1];
            int[] R = new int[right - mid + 2];
            int com = 0;

            for(int m=0;m<mid-left;m++)
            {
                L[m] = list[m+left];
            }
            
            for(int i=0;i<right-mid+1;i++)
            {
                R[i] = list[mid + i];
            }

            L[mid - left] = int.MaxValue;
            R[right - mid + 1] = int.MaxValue;

            int j= 0, k = 0;
            for(int l=left;l<=right;l++)
            {
                if (L[j] <= R[k]) list[l] = L[j++];
                else list[l] = R[k++];
                com++;
            }
            return com;
        }
    }
}