Create Solution2.cpp

Author: yanglbme

solution/0200-0299/0215.Kth Largest Element in an Array/Solution2.cpp

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