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>
#include <stdlib.h>
#define MAX 2000000000
int S[500005],n,count=0;
void Merge(int left,int mid,int right)
{
	int *q=(int *)malloc(sizeof(int)*(mid-left+1));
	int *p=(int *)malloc(sizeof(int)*(right-mid+1));
	int k,i,j;
	for(i=0;i<mid-left;i++)
	p[i]=S[i+left];
	for(i=0;i<right-mid;i++)
	q[i]=S[i+mid];
	p[mid-left]=q[right-mid]=MAX;
	i=j=0;
	for(k=left;k<right;k++)
	{
		if(q[i]>p[j])
		S[k]=p[j++];
		else
		S[k]=q[i++];
		count++;
	}
}
void MergeSort(int left,int right)
{
	if(left+1<right)
	{
		int mid=(left+right)/2;
		MergeSort(left,mid);
		MergeSort(mid,right);
		Merge(left,mid,right);
	}
}
int main(int argc, char *argv[])
{
	int i;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	scanf("%d",&S[i]);	
	MergeSort(0,n);
	for(i=0;i<n;i++)
	if(i+1==n)
	printf("%d\n%d\n",S[i],count);
	else
	printf("%d ",S[i]);
	return 0;
}