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 Scala (judge verdict: Wrong Answer)

import java.util.concurrent.{ForkJoinPool, RecursiveTask}

import scala.annotation.tailrec
import scala.util.Random

object Main extends App {
  val length = 100
  val randomList = (for (i <- 1 to length) yield Random.nextInt(100)).toList
  println(randomList)

  val pool = new ForkJoinPool()

  class AggregateTask(list: List[Int]) extends RecursiveTask[List[Int]] {

    override def compute(): List[Int] = {
      val n = list.length / 2
      if (n == 0) {
        list
      } else {
        val (left, right) = list.splitAt(n)
        val leftTask = new AggregateTask(left)
        val rightTask = new AggregateTask(right)
        leftTask.fork()
        rightTask.fork()
        merge(leftTask.join(), rightTask.join())
      }
    }

    private[this] def merge(left: List[Int], right: List[Int]): List[Int] = {
      @tailrec
      def mergeRec(left: List[Int], right: List[Int], merged: List[Int]): List[Int] = {
        (left.isEmpty, right.isEmpty) match {
          case (true, true) => merged
          case (true, false) => mergeRec(left, right.tail, right.head :: merged)
          case (false, true) => mergeRec(left.tail, right, left.head :: merged)
          case _ => (left.head, right.head) match {
            case (l, r) if l < r => mergeRec(left.tail, right, l :: merged)
            case (_, r) => mergeRec(left, right.tail, r :: merged)
          }
        }
      }

      mergeRec(left, right, List()).reverse
    }

  }

  val sortedList = pool.invoke(new AggregateTask(randomList))
  println(sortedList)
}