Kth Largest Element - Read Statement

Given an integer array nums and an integer k, return the $k$th largest element. Note that it's the $k$th largest in sorted order, not the $k$th distinct element.

Example: For [3,2,1,5,6,4] and $k=2$, the answer is $5$ (the sorted array is $[6,5,4,3,2,1]$). You could sort in $O(n \log n)$, but can you do better?