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 N 1000000001
int L[500000],R[500000];
int count;
void X (int hi[],int n,int l,int m,int r);
void Y (int hi[],int n,int l,int r);
int main()
{
  int i,j,k;
  int hi[500000];
  scanf ("%d",&k);
  for (i=0;i<k;i++){
    scanf ("%d",&hi[i]);
  }
  Y(hi,k,0,k);
  for (i=0;i<k;i++){
    printf ("%d",hi[i]);
    if (i!=k-1)
      printf (" ");
  }
  printf ("\n");
  printf ("%d\n",count);
  return 0;
}
void X (int hi[],int n,int l,int m,int r){
  int s,t;
  int i=0,j=0,p;
  s=m-l;
  t=r-m;
  for(i=0;i<s;i++)
    L[i]=hi[l+i];
  for(i=0;i<t;i++)
    R[i]=hi[m+i];
  
  L[s]=N;
  R[t]=N;

  i=0, j=0;
  for (p=l;p<r;p++){
    count++;
    if (L[i]<=R[j]){
      hi[p]=L[i++];
    }else{
      hi[p]=R[j++];
    }
  }
}
void Y (int hi[],int n,int l,int r){
  int m;
  if (l+1<r){
    m=(l+r)/2;
    Y(hi,n,l,m);
    Y(hi,n,m,r);
    X(hi,n,l,m,r);
  }
}