215-Kth-Largest-Element-In-Array.kt

class Solution {
    fun findKthLargest(nums: IntArray, k: Int): Int {
        val heap = PriorityQueue<Int>()

        for (num in nums) {
            heap.add(num)

            if (heap.size > k)
                heap.poll()
        }

        return heap.peek()
    }
}