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 MAX 500010
#define INFTY 700000000

void marge(int *,int,int,int);
void margeSort(int *,int,int);

int L[MAX];
int R[MAX];
int sort_count=0;

int main(){
  int i=0;
  int j=0;
  int n=0;
  int S[MAX];
  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&S[i]);
  }
  margeSort(S,0,i);

  for(i=0;i<n;i++){
    if(i!=0)printf(" ");
    printf("%d",S[i]);
  }
  printf("\n");
  printf("%d\n",sort_count);
  
  return 0;
}

void marge(int *S,int left,int mid, int right){
  int i=0;
  int j=0;
  int n_S=0;
  int n_left=0;
  int n_right=0;
  
  n_left=mid-left;
  n_right=right-mid;
  
  for(i=0;i<n_left;i++){
    L[i]=S[left+i];
  }
  
  for(i=0;i<n_right;i++){
    R[i]=S[mid+i];
  }
  
  L[n_left]=INFTY;
  R[n_right]=INFTY;
  i=0;
  j=0;
  
  for(n_S=left;n_S<right;n_S++){
    sort_count++;
    if(L[i]<=R[j]){
      S[n_S]=L[i];
      i++;
    }
    else{
      S[n_S]=R[j];
      j++;
    }
    
  }

}

void margeSort(int *S,int left,int right){
  int mid=0;
  if(left+1<right){
    mid=(left+right)/2;
    margeSort(S,left,mid);
    margeSort(S,mid,right);
    marge(S,left,mid,right);
  }
}