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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>

int partition(int a [], int l, int r) {
    int i = l - 1;
    int j = r;
    int temp;
 
    int pivot = a[r];
 
    while (1) {
        i++;
        while (a[i] < pivot) {
            i++;
        }
        j--;
        while (i < j && pivot < a[j]) {
            j--;
        }
     
        if (i >= j) {
            break;
        }
 
        temp = a[i];
        a[i] = a[j];
        a[j] = temp;
    }
    temp = a[i];
    a[i] = a[r];
    a[r] = temp;
    return i;
}

void quickSort(int a[], int l, int r) {
    int v;
    if (l >= r) {
        return;
    }
    v = partition(a, l, r);
    quickSort(a, l, v - 1);
    quickSort(a, v + 1, r);
}

int main() {
    int N, K;
    scanf("%d %d", &N, &K);
    int l[N];
    for (int i = 0; i < N; i++) {
        scanf("%d", &l[i]);
    }
    quickSort(l, 0, N);
    int num = 0;
    for (int i = N - 1; i > N - 1 - K; i--) {
        num = num + l[i];
    }
    printf("%d\n", num);
}