Kth smallest number

PHOTO EMBED

Sun Jun 05 2022 21:57:33 GMT+0000 (Coordinated Universal Time)

Saved by @Ranjan_kumar #c++

priority_queue<int> maxH;
for(int i=0;i<size;i++)
  {
    maxH.push(arr[i]);
    if(maxH.size()>k)
      {
        maxH.pop();
      }
  }
return maxH.top();
content_copyCOPY

priority queue is max heap(sorting) Given: 1.k 2.largest/smallest if largest use min heap and vise versa;