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 scala.io.StdIn.{readLine,readInt}
import scala.collection.mutable.ListBuffer
import scala.language.postfixOps

object Main {
  private[this] var cnt = 0
  val b = new ListBuffer[(Int,Int)]

  def merge(a:Array[Int],left:Int,mid:Int,right:Int) = {
    val n1 = mid-left
    val n2 = right-mid
    val ll = for(i<-left to mid iterator) yield {
      val x = if(i<mid) a(i) else Int.MaxValue; x
    }
    val rl = for(i<-mid to right iterator) yield {
      val x = if(i<right) a(i) else Int.MaxValue; x
    }
    var i=0
    var j=0
    var l = ll.next
    var r = rl.next
    for(k<-left until right) {
      if(l<=r){
        a(k) = l
        if(ll.hasNext) l = ll.next
      } else  {
        a(k)=r
        if(rl.hasNext) r = rl.next
      }
      cnt += 1
    }
  }

  def sort(n:Int):Iterator[(Int,Int)] = {
    var l2 = Iterator((0,n/2),(n/2,n))
    var n2 = n/2
    while(n2>1) {
      l2 = for(i<-l2;j<-List((i._1,(i._2+i._1)/2),((i._2+i._1)/2,i._2)) iterator) yield j
      n2 = n2/2
    }
    l2
  }

  def mergeSort(l:Iterator[(Int,Int)],a:Array[Int],n:Int):Unit = {
    if(n==1) return
    else {
      var i = 0
      var left = 0
      var right = 0
      b.clear()
      for(e<-l) {
          val mid = (e._2+e._1)/2
          if(e._2-e._1>1)
            merge(a,e._1,mid,e._2)
          if(i==1) {
            right = e._2
            b += ((left,right))
            i = 0
          } else {
            left = e._1
            i = 1
          }
      }
      mergeSort(b.to[Iterator],a,n/2)
    }
  }

  def main(args:Array[String]) = {
    val n = readInt
    val a = readLine.split(" ").map(_.toInt)
    mergeSort(sort(n),a,n)
    merge(a,0,n/2,n)
    println(a.mkString(" "))
    println(cnt)
  }
}