Leetcode. Top K Frequent Elements

.kt

fun topKFrequent(numbers: IntArray, k: Int): IntArray {
    val map = numbers.toList().groupingBy { it }.eachCount()
    val priorityQueue = PriorityQueue<Pair<Int, Int>>(compareBy { it.second })
    map.forEach { (number, count) ->
        priorityQueue.offer(Pair(number, count))
        if (priorityQueue.size > k) {
            priorityQueue.poll()
        }
    }
    return IntArray(k) { priorityQueue.poll().first }
}