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: Wrong Answer)

#include<stdio.h>

#define N 500000
#define Keeper 1000000000

int count;

void MergeSort(int *,int,int);
void Merge(int *,int,int,int);

int main(){
  int loop;
  int i;
  int Retu[N];
  
  scanf(" %d",&loop);
  for(i=0;i<loop;i++){
    scanf(" %d",&Retu[i]);
  }

  MergeSort(Retu,0,loop);

  for(i=0;i<loop-1;i++){
    printf("%d ",Retu[i]);
  }
  
  printf("%d\n%d\n",Retu[loop-1],count);
  
  return 0;
}

void MergeSort(int *X,int lside,int rside){
  int center;
  
  if(lside+1<rside){
    center=(lside+rside)/2;
    MergeSort(X,lside,center);
    MergeSort(X,center,rside);
    Merge(X,lside,center,rside);
  }
}

void Merge(int *X,int lside,int center,int rside){
  int i,j,k;
  int Lreng,Rreng;
  int Left[N/2],Right[N/2];

  Lreng=center-lside;
  Rreng=rside-center;
  
  for(i=0;i<Lreng;i++){
    Left[i]=X[lside+i];
  }
  
  for(i=0;i<Rreng;i++){
    Right[i]=X[center+i];
  }

  Left[Lreng]=Keeper;
  Right[Rreng]=Keeper;

  i=0;
  j=0;

  for(k=lside;k<rside;k++){
    if(Left[i]<=Right[j]){
      X[k]=Left[i];
      i++;
      count++;
    }
    else{
      X[k]=Right[j];
      j++;
      count++;
    }
  }
 
}