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# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static void Main(string[] args)
    {
        string[] line = Console.ReadLine().Split(' ');
        int[] sticks = new int[2];
        sticks[0] = int.Parse(line[0]);
        sticks[1] = int.Parse(line[1]);

        List<int> list = new List<int>();

        string[] line2 = Console.ReadLine().Split(' ');
        for(int i=0; i<sticks[0]; i++){
            int num = int.Parse(line2[i]);
            list.Add(num);
            if(list.Count > sticks[1]){
                list.Sort();
                list.Remove(list[0]);
            }
        }

        int sum = 0;
        for(int i=0; i<list.Count; i++){
            sum += list[i];
            Console.WriteLine(list[i]);
        }

        Console.WriteLine(sum.ToString());
    }
}