priority_queue<int> maxH; for(int i=0;i<size;i++) { maxH.push(arr[i]); if(maxH.size()>k) { maxH.pop(); } } return maxH.top();
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter