Solved problem 703 : Kth Largest Element In A Stream

racoelhosilva · racoelhosilva · commit 58b9d07efe19 · 2023-12-19T10:04:51.000Z
diff --git a/Priority Queue/Easy/703_KthLargestElementInAStream.cpp b/Priority Queue/Easy/703_KthLargestElementInAStream.cpp
@@ -0,0 +1,38 @@
+/* 
+ * Problem: 703 
+ * Name: Kth Largest Element In A Stream
+ * Difficulty: Easy
+ * Topic: Priority Queue
+ * Link: https://leetcode.com/problems/kth-largest-element-in-a-stream/
+ */
+ 
+#include <bits/stdc++.h>
+using namespace std;
+
+class KthLargest {
+private:
+    // Priority Queue (Min Heap)
+    priority_queue<int, vector<int>, greater<int>> values;
+    int size;
+
+public:
+    // Constructor accepts values but restrains to max k size
+    KthLargest(int k, vector<int>& nums) {
+        this->size = k;
+        for (const int &n : nums){
+            values.push(n);
+            if (values.size() > size){
+                values.pop();
+            }
+        }
+    }
+    
+    // Adding values works the same as the constructor
+    int add(int val) {
+        values.push(val);
+        if (values.size() > size){
+            values.pop();
+        }
+        return values.top();
+    }
+};
diff --git a/README.md b/README.md
@@ -16,7 +16,7 @@
 
 ### Problems Solved
 
-| Total | 41 |
+| Total | 42 |
 |:---:|:---:|
 
 #### Search By Topic
@@ -36,7 +36,7 @@
 | Intervals | 1 |
 | Linked Lists | 5 |
 | Math & Geometry | 2 |
-| Priority Queue | 0 |
+| Priority Queue | 1 |
 | Sliding Window | 1 |
 | Stack | 2 |
 | Tries | 0 |
@@ -46,7 +46,7 @@
 
 | Difficulty | Number |
 |:---|---:|
-| Easy | 40 |
+| Easy | 41 |
 | Medium | 1 |
 | Hard | 0 |
 
