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)

#include<stdio.h>

int temp[500000],cnt=0;

void MergeSort(int left,int right,int a[]);

void MergeSort(int left,int right,int a[]){
  int m,i,j,k;
  
  //printf("%d,%d,%d\n",left,right,a[0]);
  if(left>=right){
    return;
  }
  //ここまではok
  
  m=(left+right)/2;
  //左側を再起で呼び出し
  MergeSort(left,m,a);
  //右側を呼び出し
  MergeSort(m+1,right,a);
  
  //a[left]からa[m]を作業領域にコピー
  for(i=left;i<=m;i++){
    temp[i]=a[i];
    //printf("%d,",temp[i]);
  }

  //a[m+1]からa[right]を逆順にコピー　
  for(i=m+1,j=right;i<=right;i++,j--){
    temp[i]=a[j];
  }

  i=left;
  j=right;
  //小さい方から配列に戻す
  for(k=left;k<=right;k++){
    cnt++;
    if(temp[i]<temp[j]){
      a[k]=temp[i++];
    }else{
      a[k]=temp[j--];
    }
  }
	
}
int main(){
  int num,array[500000],i;

  scanf("%d",&num);
  for(i=0;i<num;i++){
    scanf("%d",&array[i]);
  }
  MergeSort(0,num-1,array);
  //printf("%d,%d\n",num,array[0]);

  for(i=0;i<num-1;i++){
    printf("%d ",array[i]);
  }
  
  printf("%d\n%d\n",array[num-1],cnt);
  return 0;
}