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<iostream>
#define MAXN 500000+5
using namespace std;
int a[MAXN];
int t[MAXN];
int count=0;
void merge(int* A,int x,int y,int* T)
{
	if(y-x>1)
	{
		int mid=x+(y-x)/2;
		int p=x,q=mid,i=x;
		merge(A,x,mid,T);
		merge(A,mid,y,T);
		while(q<y||p<mid)
		{
			if(q>=y||(p<mid&&A[p]<=A[q]))T[i++]=A[p++];
			else T[i++]=A[q++];
			count++;
		}
		for(i=x;i<y;i++)
		    A[i]=T[i];
	}
}
int main()
{
	int n;
	int i,j;
	cin>>n;
	for(i=0;i<n;i++)
	    cin>>a[i];
	merge(a,0,n,t);
	for(i=0;i<n-1;i++)
	    cout<<t[i]<<' ';
	cout<<t[n-1]<<endl;
	cout<<count<<endl;    
	return 0;
}