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>
using namespace std;
const int mx=500000,mm=200000000;
int L[mx/2+2],R[mx/2+2];
int cnt;

void merg (int a[],int n,int le,int mi,int ri){
    int n1=mi-le;
    int n2=ri-mi;
    for(int i=0;i<n1;i++)L[i]=a[le+i];
    for(int i=0;i<n2;i++)R[i]=a[mi+i];
    L[n1]=R[n2]=mm;
    int i=0,j=0;
    for(int k=le;k<ri;k++){
        cnt++;
        if(L[i]<=R[j]){
            a[k]=L[i++];
        }else{
            a[k]=R[j++];
        }
    }
}

void mergesort(int a[],int n,int le,int ri){
    if(le+1<ri){
        int mi=(le+ri)/2;
        mergesort(a,n,le,mi);
        mergesort(a,n,mi,ri);
        merg(a,n,le,mi,ri);
    }
}

int main(){
    int a[mx],n,i;
    cnt=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
    }
    mergesort(a,n,0,n);
    for(int i=0;i<n;i++){
            if(i)printf(" ");
    printf("%d",a[i]);
    }
    printf("\n%d\n",cnt);
return 0;}