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>

#define N 500000
 
int L[(N/2)+2],R[(N/2)+2];
int a;
 
void merge(int b[],int l,int m,int r){
  int d,i,j,e=m-l,f=r-m;
  
  for(i=0;i<e;i++){
    
  L[i]=b[l+i];
  
  }
  
  for(i=0;i<f;i++){
    
  R[i]=b[m+i];
  
  }
  
  L[e]=1000000000;
  
  R[f]=1000000000;
  
  i=0;
  
  d=0;
  
  for(j=l;j<r;j++){

      a++;
      
      if(L[i]<=R[d]){
	
        b[j]=L[i];
	
	i+=1;
	
      }
      
      else {
	
      b[j]=R[d];
      
      d+=1;
      
      }
    }
}

void mergeSort(int b[],int l,int r){

  int m;
  
  if(l+1<r){
    
    m=(l+r)/2;
    
    mergeSort(b,l,m);
    
    mergeSort(b,m,r);
    
    merge(b,l,m,r);
    
  }
}
 
int main(){
  
  int b[N],c,i;
  
  a=0;
  
  scanf("%d",&c);
  
  for(i=0;i<c;i++){
    
  scanf("%d",&b[i]);
  
  }
  
  mergeSort(b,0,c);
  
  for(i=0;i<c-1;i++){
    
    printf("%d ",b[i]);
    
  }
  
   printf("%d\n",b[c-1]);
   
   printf("%d\n",a);
 
  return 0;
}