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>
#define N 500000

int tmp[N], cnt;

void MergeSort(int data[], int left, int right){
    int mid,i,j,k;
    if(left>=right)return;
    mid = (left + right) / 2;
    MergeSort(data, left, mid);
    MergeSort(data, mid+1, right);
    for(i=left;i<=mid;i++) tmp[i] = data[i];
    for(i=mid+1,j=right;i<=right;i++,j--) tmp[i] = data[j];
    i = left;
    j = right;
    for(k=left;k<=right;k++,cnt++){
        if(tmp[i] <= tmp[j]) data[k] = tmp[i++];
        else data[k] = tmp[j--];
    }
}

int main(){
    int n, data[N], i;
    scanf("%d",&n);
    for(i=0;i<n;i++) scanf("%d", &data[i]);
    MergeSort(data, 0, n-1);
    for(i=0; i<n-1; i++) printf("%d ", data[i]);
    printf("%d\n%d\n", data[n-1], cnt);
    return 0;
}