climbing the leaderboard

Solution.scala

object Solution {

    // Complete the climbingLeaderboard function below.
    def climbingLeaderboard(scores: Array[Int], alice: Array[Int]) = {
        val score2 = scores.distinct
        val length = score2.length-1
        var j = length
        
        for(i:Int <- alice) yield {
           val cond =  score2.search[Int](i)(Ordering[Int].reverse) match {
                case Found(foundIndex) => foundIndex
                case _ => -1
            }
            if(cond != -1) {
                cond +1
            } else if(score2(length) > i) {
                length +2
            } else if (score2(0) < i) {
                1
            } else {
                while (score2(j)<i) {
                    j -=1
                }
                j+2
            }
        }
        
    }

    def main(args: Array[String]) {
        val stdin = scala.io.StdIn

        val printWriter = new PrintWriter(sys.env("OUTPUT_PATH"))

        val scoresCount = stdin.readLine.trim.toInt

        val scores = stdin.readLine.split(" ").map(_.trim.toInt)
        val aliceCount = stdin.readLine.trim.toInt

        val alice = stdin.readLine.split(" ").map(_.trim.toInt)
        val result = climbingLeaderboard(scores, alice)
        
        printWriter.println(result.mkString("\n"))

        printWriter.close()
    }
}