Add files via upload

Author: parmeet9891

data-structures/Priority_Queues/kthLargestUsingPriorityQueue.cpp

@@ -0,0 +1,44 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+/*
+
+Given an array A of random integers and an integer k, find and return the kth largest element in the array.
+
+*/
+
+int kthLargest (vector<int> arr, int n, int k){
+
+    priority_queue<int, vector<int>, greater<int>> pq;
+	
+	for(int i = 0; i < k; i++) {
+		pq.push(arr[i]);
+	}
+	
+	for(int i = k; i < n; i++) {
+		int val = pq.top();
+		if(arr[i] > val) {
+			pq.pop();
+			pq.push(arr[i]);
+		}
+	}
+	
+	return pq.top();
+    
+}
+
+int main() {
+	    int n, k, s;
+    vector<int> arr;
+    cin >> n;
+
+    for (int i = 0; i < n; i++) {
+        cin >> s;
+        arr.push_back(s);
+    }
+    
+    cin >> k;
+    cout << kthLargest(arr, n, k) << endl;
+}
+
+