Total of the largest orders

Problem

Given n order amounts and a number k, print the total of the k largest amounts. Repeating max and remove k times is too slow when k is large.

Example

Input

5 2
40 15 90 27 63

Output

Try the problem first. Open one hint at a time.

Hint 1

Each max plus remove is O(n), and you repeat it k times.

Hint 2

Sort once, descending, then add the first k amounts.

Write your Python code, run it on the examples and submit it to hidden tests.