https://practice.geeksforgeeks.org/problems/kth-smallest-element/0 Make priority queue of size k, insert first k elements from the array For the remaining elements, pop and insert into pq if element is smaller than top class Solution { public: int kthSmallest(int arr[], int l, int r, int k) { priority_queue<int, vector<int>> pq(arr, arr + k); int n = r - l + 1; for (int i = k; i < n; i++) { if (arr[i] < pq.

https://www.geeksforgeeks.org/building-heap-from-array/ #include <bits/stdc++.h> using namespace std; class Heap { vector<int> v; bool isMinHeap; bool compare(int a, int b) { return isMinHeap ? a < b : a > b; } void heapify(int i) { int left = 2 * i, right = 2 * i + 1; int minIdx = i; if (left < (int)v.size() && compare(v[left], v[minIdx])) { minIdx = left; } if (right < (int)v.size() && compare(v[right], v[minIdx])) { minIdx = right; } if (minIdx !