Submission #46366094

---

Source Code Expand

import java.util.TreeMap
import kotlin.math.pow

fun main() {
    val n = readln().toInt()
    val sc = Array(n) {
        readln().split(" ").map { it.toLong() }.toLongArray()
    }
        .sortedBy { it[0] }

    val treeMap = TreeMap<Long, Long>()
    for((s, c) in sc) {
        treeMap[s] = c
    }

    val ans = process(treeMap)
    println(ans)
}

fun process(treeMap: TreeMap<Long, Long>): Long {
    var count = 0L

    while(treeMap.isNotEmpty()) {
        val (s, c) = treeMap.firstEntry()

        if(c < 2) {
            count += c
            treeMap.remove(s)
            continue
        }

        val num = countDiv(c)

        val mul = s * num
        treeMap[mul] = treeMap.getOrDefault(mul, 0) + 1

        treeMap[s] = c - num
    }
    return count
}

fun countDiv(n: Long): Long {
    var num = n

    var count = 0
    while (true) {
        num /= 2
        if(num == 0L) {
            break
        }
        count++
    }
    return 2.0.pow(count).toLong()
}

Submission Info

Judge Result