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

Author: a93a

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

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