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 JAVA (judge verdict: Memory Limit Exceeded)

import java.util.*;
import java.io.*;
class Main{
    public static int count=0;
    public static int[] l;
    public static int[] r;
    public static void main(String args[]){
	l = new int[100000];
	r = new int[100000];
	int i,n;
	int s[] = new int[100000];
	Scanner scan = new Scanner(System.in);
	
	n = scan.nextInt();
	for(i=0;i<n;i++){
	    s[i] = scan.nextInt();
	}
	mergeSort(s,0,n);
	for(i=0;i<n;i++){
	    if(i==n-1){
		System.out.println(s[i]);
		System.out.println(count);
		continue;
	    }
	    System.out.print(s[i]+" ");
	}
    }

    public static void merge(int s[],int left,int mid,int right){
	int i,j,k,n1,n2;
	n1 = mid -left;
	n2 = right - mid;
	
	for(i=0;i<n1;i++){
	    l[i] = s[left+i];
	}
	for(i=0;i<n2;i++){
	    r[i] = s[mid+i];
	}
	l[n1] = 2147483647;
	r[n2] = 2147483647;
	i=0;
	j=0;
	for(k=left;k<right;k++){
	    if(l[i]<=r[j]){
		s[k] = l[i];
		i = i+1;
		count++;
	    }
	    else{
		s[k] = r[j];
		j = j+1;
		count++;
	    }
	}
    }
    
    public static void mergeSort(int s[],int left,int right){
	int mid=0;
	int a[] = new int[100000];
	if(left+1<right){ /*分割する*/
	    mid = (left+right)/2;
	    mergeSort(s,left,mid);
	    mergeSort(s,mid,right);
	    merge(s,left,mid,right);
	}
    }
    
}