K largest and smallest elements 

#include <iostream>
#include <queue>
using namespace std;

int main() {
    
    // Kth Smallest Element 
    
    int A[] = {7,10,4,3,20,15};
    int k = 3;
    int size = sizeof(A)/sizeof(A[0]);
    
    
    // priority_queue<int> mheap;
    
    // for(int i=0 ; i<size; i++){
        
    //     mheap.push(A[i]);
    //     if(mheap.size()>k)
    //         mheap.pop();
    
    // }
    
    // cout<<mheap.top();
    
    priority_queue<int,vector<int>, greater<int>> minh;
    for(int i=0; i<size ; i++){
        minh.push(A[i]);
        if(minh.size()>k){
            minh.pop();
        }
    }
    cout<<minh.top();
    
    
    
}