int findKthLargest(vector<int>& A, int k) { nth_element(begin(A), begin(A) + k - 1, end(A), greater<int>()); return A[k - 1]; }
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