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