Problem:
Score : 200 points

Problem Statement

Snuke has N sticks.
The length of the i-th stick is l_i.

Snuke is making a snake toy by joining K of the sticks together.

The length of the toy is represented by the sum of the individual sticks that compose it.
Find the maximum possible length of the toy.

Constraints

1 \leq K \leq N \leq 50

1 \leq l_i \leq 50

l_i is an integer.

Input

Input is given from Standard Input in the following format:

N K
l_1 l_2 l_3 ... l_{N}

Output

Print the answer.

Sample Input 1

5 3
1 2 3 4 5

Sample Output 1

12

You can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5, which is the maximum possible length.

Sample Input 2

15 14
50 26 27 21 41 7 42 35 7 5 5 36 39 1 45

Sample Output 2

386

Solution in JavaScript (node.js v5.12) (judge verdict: Accepted)

// https://atcoder.jp/contests/abc067/tasks/abc067_b
"use strict";
function Main(input) {
  const params = input.split("\n");
  // const [N, K] = params[0].split(" ").map(Number);
  const K = params[0].split(" ").map(Number)[1];
  const ln = params[1]
    .split(" ")
    .map(Number)
    .sort((a, b) => b - a);

  let len = 0;
  for (let i = 0; i < K; i++) {
    len += ln[i];
  }

  console.log(len);
}
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));