Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Top K Values

Top K Values

Difficulty: 1100 3500 ms 128 MB

heap sorting

Print the K largest values in decreasing order (duplicates kept).

Input: the first line has N and K; the second line has N integers.

Output: the K largest values, descending.

Constraints:

  • 1 ≤ K ≤ N ≤ 105
  • −109 ≤ ai ≤ 109

Sample Tests

Input 1
5 2
3 1 5 2 4
Output 1
5 4
Input 2
1 1
7
Output 2
7

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen