K Largest Elements

Problem Return the k largest values from a list of n elements (in any order, or sorted descending if the format requires).

Input / Output

• Input: an integer array nums and an integer k.
• Output: the k largest values.

Constraints

• 1 <= k <= n <= 10^5.
• Values may repeat; duplicates count separately.

Example

• nums = [3,1,5,12,2,11], k = 3 -> [12,11,5].