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)

/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/

/*
* File: main.c
* Author: Ivan
*
* Created on July 2, 2018, 3:17 PM
*/

#include <stdio.h>
#include <stdlib.h>
#define INFTY 1000000001
#define MAX_SIZE 500000
/*
*
*/

int Left[MAX_SIZE/2 + 2], Right[MAX_SIZE/2 + 2];
int count = 0;

void merge(int A[], int left, int mid, int right);
void mergeSort(int A[], int left, int right);

int main(int argc, char** argv) {
int *A, n;
scanf("%d", &n);
A = (int *)malloc(sizeof(int) * n);

for (int jx = 0; jx < n; ++jx) scanf("%d", &A[jx]);

mergeSort(A, 0, n);

for (int ix = 0; ix < n; ++ix)
{
if (ix) printf(" ");
printf("%d", A[ix]);
}
printf("\n%d\n", count);

return (EXIT_SUCCESS);
}

void merge(int A[], int left, int mid, int right)
{
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; ++i) Left[i] = A[left + i];
for (int j = 0; j < n2; ++j) Right[j] = A[mid + j];
Left[n1] = INFTY;
Right[n2] = INFTY;
int i = 0, j = 0;
for (int k = left; k < right; ++k)
{
if (Left[i] <= Right[j])
{
A[k] = Left[i];
i = i + 1;
}
else
{
A[k] = Right[j];
j = j + 1;
}
count++;
}
}

void mergeSort(int A[], int left, int right)
{
if (left + 1 < right)
{
int mid = (left + right) / 2;
mergeSort(A, left, mid);
mergeSort(A, mid, right);
merge(A, left, mid, right);
}
}