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: Memory Limit Exceeded)

import scala.io.StdIn.{readLine,readInt}
import scala.collection.mutable.ListBuffer
import scala.language.postfixOps

object Main {
  private[this] var cnt = 0
  private[this] val l = new Array[Int](260000)
  private[this] val r = new Array[Int](260000)

  def merge(a:Array[Int],left:Int,mid:Int,right:Int) = { val n1 = mid-left
    val n2 = right-mid
    Array.copy(a,left,l,0,n1)
    l(n1) = Int.MaxValue
    Array.copy(a,mid,r,0,n2)
    r(n2) = Int.MaxValue
    var i=0
    var j=0
    for(k<-left until right) {
      if(l(i)<=r(j)){
        a(k) = l(i)
        i += 1
      } else  {
        a(k)=r(j)
        j += 1
      }
      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]):Unit = {
    if(!l.hasNext) return
    else {
      val l2 = for(Seq(e1,e2)<-l.grouped(2)) yield {
          val mid = (e1._2+e1._1)/2
          if(e1._2-e1._1>1)
            merge(a,e1._1,mid,e1._2)

          val mid2 = (e2._2+e2._1)/2
          if(e2._2-e2._1>1)
            merge(a,e2._1,mid2,e2._2)

          (e1._1,e2._2)
      }
      mergeSort(l2,a)
    }
  }

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