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)

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include<stdio.h>
#include<stdlib.h>
void merge(int*, int, int, int,int*);
void mergeSort(int*, int, int,int*);
int main() {
	int *S, n, i,cnt=0;
	scanf("%d", &n);
	S = (int*)calloc(n+1, sizeof(int));
	for (i = 0; i < n; i++)scanf("%d", S + i);
	mergeSort(S, 0, n,&cnt);
	for (i = 0; i < n; i++)printf("%d%c", *(S + i), i < n - 1 ? ' ' : '\n');
	printf("%d\n", cnt);
	free(S);
	return 0;
}

void merge(int *A, int l, int m, int r,int* cnt) {
	int n1 = m - l, n2 = r - m, *L, *R, i, j, k;
	L = (int*)malloc(sizeof(int)*n1+1);
	R = (int*)malloc(sizeof(int)*n2+1);
	for (i = 0; i < n1; i++) *(L + i) = *(A + l + i);
	for (i = 0; i < n2; i++) *(R + i) = *(A + m + i);
	*(L + n1) = 2147483647;
	*(R + n2) = 2147483647;
	for (k = l, i = j = 0; k < r; k++) {
		++*(cnt);
		if (*(L + i) <= *(R + j)) { *(A + k) = *(L + i); ++i; }
		else { *(A + k) = *(R + j); ++j; }
		
	}
	//free(L); free(R);
}

void mergeSort(int *A, int l, int r,int *cnt) {
	int m;
	if (l + 1 < r) {
		m = (l + r) / 2;
		mergeSort(A, l, m,cnt);
		mergeSort(A, m, r,cnt);
		merge(A, l, m, r,cnt);
	}
}