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 X 500000
#define Y 1000000001

void Merge(int *, int, int, int);
void MergeSort(int *, int, int);
void Print(int *);
int count = 0;

main(){
  int i, n;
  int A[X];
  

  scanf("%d",&n);
  for(i = 0; i < n; i++)
    scanf("%d",&A[i]);


  MergeSort(A, 0, n);

  for(i = 0; i < n; i++)
    if(i == n - 1)
      printf("%d\n",A[i]);
    else
      printf("%d ",A[i]);
  printf("%d\n",count);
  
  return 0;
}



void Merge(int *A, int B, int C, int D){
  int i, j, k, N1, N2;
  int La[X], Ra[X];
  
  N1=C-B;
  N2=D-C;

  for(i = 0; i < N1; i++){
    La[i] = A[B+i];
  }
  for(i = 0; i < N2; i++){
    Ra[i] = A[C+i];
  }
  
  La[N1] = Y;
  Ra[N2] = Y;
  
  i = 0; 
  j = 0;
  
  for(k = B; k <= D - 1; k++){
    count++;
    if( La[i] <= Ra[j] )
      A[k] = La[i++];
    else
      A[k] = Ra[j++];
  }
  
  
}


void MergeSort(int *A, int B, int D){  
  int C;
  
  if( B+1 < D ){
    C=(B+D) / 2;
    
    MergeSort(A, B, C);
    MergeSort(A, C, D);
    Merge(A, B, C, D);
  }
}