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: Wrong Answer)


import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		// 整数の入力
		int a = sc.nextInt();
		// スペース区切りの整数の入力
		int b = sc.nextInt();
		int[] c=new int[a];
		for(int i=0;i<a;i++)
	 c[i] = sc.nextInt();
int tmp=0;
int j=0;
int[] d=new int[b];
int ans=0;
int count=0;
for(int i=0;j<b;i++){
  
    if(tmp<c[i]){
    tmp=c[i];
    count=i;
    }
    if(i==a-1){
        c[count]=0;
        i=0;
        d[j]=tmp;
        j++;
        tmp=0;
    }
    
 }
 for(int i=0;i<b;i++)
 ans+=d[i];
 // 文字列の入力
		//String s = sc.next();
		// 出力
		System.out.println(ans);
	}
}