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)

/*
17D8101031C 杉山　祥吾 ID:keisei334 C
*/

#include<stdio.h>
#define N 500000

int cnt=0;

int a[N];

void merge(int left,int mid,int right){
  int L[N/2];
  int R[N/2];
  int i,j,idx;
	
  for(i=left;i<=mid;i++)
    L[i-left]=a[i];
	
	
  for(i=mid+1;i<=right;i++)
    R[i-mid-1]=a[i];

  i=0;  j=0;  idx=left;
	
  while(i<=(mid-left) && j<=(right-mid-1)){
    if(L[i] < R[j])
      a[idx++]=L[i++];
			
    else 
      a[idx++]=R[j++];
			
    cnt++;
  }
	
  while(i<=(mid-left)){
    a[idx++]=L[i++];
    cnt++;
  }
	
  while(j<=(right-mid-1)){
    a[idx++]=R[j++];
    cnt++;
  }	
}

void mergeSort(int left,int right){
  int mid=(left+right)/2;
	
  if(left < right){
    mergeSort(left,mid);
    mergeSort(mid+1,right);
    merge(left,mid,right);
  }
}

int main(){
	int n,i;
	
	scanf("%d",&n);
	
	for(i=0;i<n;i++)
		scanf("%d",&a[i]);
	
	mergeSort(0,n-1);
	
	for(i=0;i<n-1;i++)
		printf("%d ",a[i]);
	printf("%d\n",a[n-1]);
	
	printf("%d\n",cnt);
	
	return 0;
	
}

/*実行結果

*/