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 Go (judge verdict: Memory Limit Exceeded)

package main

import (
	"fmt"
)

var count = 0

func main() {
	var n int
	fmt.Scan(&n)

	s := make([]int, n)
	for i := range s {
		fmt.Scan(&s[i])
	}

	sorted := mergeSort(s)
	str := fmt.Sprint(sorted)
	fmt.Println(str[1:len(str)-1])
	fmt.Println(count)
}

func mergeSort(n []int) []int {
	i := len(n) / 2
	if i == 0 {
		return n
	}
	left := mergeSort(n[:i])
	right := mergeSort(n[i:])
	return merge(left, right, []int{})
}

func merge(left, right, merged []int) []int {
	if len(left) == 0 && len(right) == 0 {
		return merged
	}

	if len(left) == 0 {
		count += len(right)
		return append(merged, right...)
	}
	if len(right) == 0 {
		count += len(left)
		return append(merged, left...)
	}

	count++
	if left[0] < right[0] {
		return merge(left[1:], right, append(merged, left[0]))
	}
	return merge(left, right[1:], append(merged, right[0]))
}