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>

int ttt[500001];
void merge(int *,int,int);
int co=0;

int main(){
  int i,q,n,m;
  int t[250005],u[250005];

  scanf("%d",&q);
  for(i=0;i<q;i++){
    scanf("%d",&t[i]);
  }

  merge(t, 0, q-1);

  for(i=0;i<q;i++){
    if(i!=q-1){
      printf("%d ",t[i]);
    }
    else printf("%d",t[i]);
  }
  printf("\n%d\n",co);
}


void merge(int t[ ],int left,int right){
  int md,i,j,o;

  if(left>=right){
    return;
  }

  md=(left+right)/2;
  merge(t, left, md);
  merge(t, md+1, right);

  for(i=left;i<=md;i++)
    ttt[i]=t[i];
  

  for(i=md+1,j=right; i<=right; i++,j--){
    ttt[i]=t[j];
  }

  i=left;
  j=right;

  for(o=left;o<=right;o++)
    if(ttt[i]<=ttt[j]){
      co++;
      t[o]=ttt[i++];
    }
    else{
      co++;
      t[o]=ttt[j--];
    }

}