0703-kth-largest-element-in-a-stream.kt

class KthLargest(k: Int, nums: IntArray) {
    val minHeap = PriorityQueue<Int>{ a: Int, b: Int ->
        a - b
    }
    var k = Integer.MIN_VALUE
    init{
        this.k = k
        for(num in nums)
            minHeap.add(num)
        while(minHeap.size > k)
            minHeap.poll()
    }
    fun add(`val`: Int): Int {
        minHeap.add(`val`)
        if(minHeap.size > k)
            minHeap.poll()
        return minHeap.peek()
    }

}