Time: 145 ms (35.24%), Space: 47.2 MB (60.53%) - LeetHub

Author: dev-ahmedhany

0215-kth-largest-element-in-an-array/0215-kth-largest-element-in-an-array.cpp

@@ -0,0 +1,14 @@
+class Solution {
+public:
+    int findKthLargest(vector<int>& nums, int k) {
+        priority_queue<int> heap;
+        for (int num: nums) {
+            heap.push(-num);
+            if (heap.size() > k) {
+                heap.pop();
+            }
+        }
+        
+        return -heap.top();
+    }
+};