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>
#include<stdlib.h>

void merge(int *,int ,int ,int);
void mergeSort(int *,int, int);

int count = 0;

int main(){
  int n,s[500000],i,left,right;

  scanf("%d",&n);
  if(500000 < n)exit(0);
  
  left = 0;
  right = n;
   
  //  s = (int *)malloc(n*sizeof(int));
  for(i = 0; i < n; i++){
    scanf(" %d",&s[i]);
    if(s[i] < 0 || 1000000000 < s[i])exit(0);
  }
  
  mergeSort(&s[0],left,right);
  
  printf("%d",s[0]);
  for(i = 1; i < n; i++){
    printf(" %d",s[i]);
  }
  printf("\n");
  printf("%d\n",count);
  
  return 0;
}

void mergeSort(int *s,int left,int right){
  int mid;

  if(left + 1 < right){
    mid = (left + right)/2;
    mergeSort(&s[0],left,mid);
    mergeSort(&s[0],mid,right);
    merge(&s[0],left,mid,right);
  }
  
}

void merge(int *s,int left,int mid ,int right){
  int n1,n2,l1[mid - left],l2[right - mid],i,j,k,inf = 99999999;
  
  n1 = mid - left;
  n2 = right - mid;

  //  l1 = (int *)malloc(n1*sizeof(int));
  //l2 = (int *)malloc(n2*sizeof(int));
  
  for(i = 0; i < n1; i++)l1[i] = s[left + i];
  for(i = 0; i < n2; i++)l2[i] = s[mid + i];
  
  l1[n1] = inf;
  l2[n2] = inf;

  i = 0;
  j = 0;

  for(k = left; k < right; k++){
    if(l1[i] <= l2[j]){
      
      s[k] = l1[i];
      i = i + 1;
      count++;
    }
    else {
      
      s[k] = l2[j];
      j = j + 1;
      count++;
    }
    
  }
}