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: Runtime Error)

#include<stdio.h>
#include<stdlib.h>
#define O 10000000
void N(int B[],int left,int right);
void M(int C[],int left,int mid,int right);
int count;

int main(){
       int A[10000000+1];
       int a,i;
       
       scanf("%d",&a);
       for(i=0;i<a;i++){
             scanf("%d",&A[i]); 
       }
       N(A,0,a);
       for(i=0;i<a;i++){
    printf("%d",A[i]);
    if(i<a-1)printf(" ");
  }
  printf("\n");
  printf("%d\n",count);
  return 0;
}

void N(int B[],int left,int right){
       int i,mid;
       if(left+1<right){
              mid=(left+right)/2;
              N(B,left,mid);
              N(B,mid,right);
              M(B,left,mid,right);
       }
}

void M(int C[],int left,int mid,int right){
  int a,b,i,j,k;
  int *L,*R;
  a=mid-left;
  b=right-mid;
  L=(int *)malloc(sizeof(int)*(a+1));
  R=(int *)malloc(sizeof(int)*(b+1));
    for(i=0;i<=a-1;i++){
    L[i]=C[left+i];
  }
  for(j=0;j<=b-1;j++){
    R[j]=C[mid+j];
  }
  L[a]=O;
  R[b]=O;
  i=0;
  j=0;
  for(k=left;k<=right-1;k++){
   if(L[i]<=R[j]){
      C[k]=L[i];
      i++;
      count++;
    }
    else{
      C[k]=R[j];
      j++;
      count++;
    }
  }
  free(L);
  free(R);
}