A tournament awards a prize pool equal to the sum of the top k player scores. Given n scores (which may be negative) and an integer k, print the sum of the k largest scores. If several scores are tied at the cutoff, they all count by position, so exactly k scores contribute.
Input format
Line 1: two integers n and k.
Line 2: n space-separated integers, the scores.
Output format
A single integer: the sum of the k largest scores.
Constraints
- 1 <= k <= n <= 100000
- -1000000000 <= each score <= 1000000000