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 C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <cstdio>
#include <iostream>
using namespace std;
int T[51];
int check[51];
int max_p = 0;

/*
void dfs(int A[], int k, int i, int n,int z){
	int x = 0;
	if(k<= 0) return;

	else {

		
		int y;
		for(int t = i; t <= n; t++){
			y = A[t];
			dfs(A, k-1, t+1, n, z+y);
			
			if(z+y>max_p) max_p = z+y;
		}
			 
		
		return;
	}
}
*/

void sort(int A[],int n){
	for(int i = 0; i < n-1; i++){
		for(int j = n-1; j > i; j--){
			if(A[j] > A[j-1]) swap(A[j], A[j-1]);
		}
	}
}

int main(){
	int N,K;
	cin >> N >> K;
	for(int i = 0; i < N; i++){
		cin >> T[i];
	}

	int i;

	int ans = 0;
	sort(T, N);
	for(int t = 0; t < K; t++){
		ans += T[t];
		
	}


	/*
	for(i = 0; i <= N-K; i++){
		dfs(T,K,0,N,0);
	
		
	}
	*/

	cout << ans << endl;


}