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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.*;

class Main {

  public static void main(String[] args) throws Exception {

    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    try {

      String inputL1 = br.readLine();
      String[] inputNum = inputL1.split(" ");

      int n = Integer.parseInt(inputNum[0]);
      int m = Integer.parseInt(inputNum[1]);

      String inputL2 = br.readLine();
      String[] strArray = inputL2.split(" ", 0);

      int[] num = new int[n];
      for (int i = 0; i < n; i++) {
        num[i] = Integer.parseInt(strArray[i]);
      }

      for (int i = 0; i < n; i++) {
        for (int j = 0; j < n - (i+1); j++) {
          if (num[j] < num[j+1]) {
            int tmp = num[j];
            num[j] = num[j+1];
            num[j+1] = tmp;
          }
        }
      }

      int ans = 0;
      for (int i = 0; i < m; i++) {
        ans += num[i];
      }

      System.out.println(ans);

    } catch(Exception e) {
      System.err.println("hoge");
    }
  }

}