impl kth largest element in an array

SKTT1Ryze · Mar 14, 2024 · 96e32ec · 96e32ec
1 parent 1d637a7
commit 96e32ec
Show file tree

Hide file tree

Showing 3 changed files with 22 additions and 1 deletion.
diff --git a/leetcode-cc/Heap.cc b/leetcode-cc/Heap.cc
@@ -19,3 +19,5 @@ template <typename T>
 T Heap<T>::top() {
   return inner[0];  // panic if inner is empty
 }
+
+template class Heap<int>;
diff --git a/leetcode-cc/KthLargestElement.hpp b/leetcode-cc/KthLargestElement.hpp
@@ -1,3 +1,4 @@
+#include "Heap.h"
 #include "TestHelper.h"
 #include "problem.h"
 #include "solution.h"
@@ -27,5 +28,18 @@ class SKthLargestElement : public ISolution {
   int benchmark() const override { return 0; }
 
  private:
-  int findKthLargest(vector<int>& nums, int k) const {}
+  int findKthLargest(vector<int>& nums, int k) const {
+    Heap<int> heap;
+
+    for (const int& num : nums) {
+      heap.insert(num);
+    }
+
+    while (k > 1) {
+      heap.pop();
+      k--;
+    }
+
+    return heap.top();
+  }
 };
diff --git a/runtime-cc/src/registration.cc b/runtime-cc/src/registration.cc
@@ -770,5 +770,10 @@ const int registerAll(std::shared_ptr<Container> handle) {
   handle->registerSolution(
       []() -> ArcSolution { return std::make_shared<SBTRightSideView>(); });
 
+  handle->registerProblem(
+      []() -> ArcProblem { return std::make_shared<PKthLargestElement>(); });
+  handle->registerSolution(
+      []() -> ArcSolution { return std::make_shared<SKthLargestElement>(); });
+
   return 0;
 }