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 Pascal (FPC 2.6.2) (judge verdict: Wrong Answer)

program Project1;

{$APPTYPE CONSOLE}

uses
  SysUtils,Classes;
function med3(x,y,z:Integer):Integer;
begin
  if (x < y) then begin
    if (y < z) then
      result:= y
    else if(z < x) then
      result:= x
    else
      result:= z;
  end else begin
    if (z < y) then
      result:= y
    else if (x < z) then
      result:= x
    else
      result:= z;
  end;
end;

procedure quicksort1(var a:array of integer;const left,right:integer);
var
  i,j,pivot,tmp:integer;
begin
  if (left < right) then begin
    i := left;
    j := right;
    pivot := med3(a[i], a[i + (j - i) div 2], a[j]);
    while true do begin
      while (a[i] < pivot) do
        inc(i);
      while (pivot < a[j]) do
        dec(j);
      if (i >= j) then
        break;
      tmp := a[i];
      a[i]:= a[j];
      a[j]:= tmp;
      inc(i);
      dec(j);
    end;
    quicksort1(a, left, i - 1);
    quicksort1(a, j + 1, right);
  end;
end;

var
  a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k:Integer;
  l:array of Integer;
  s,s123,s1,s2,s3:string;
  tf:Boolean;
  nyu:TStringList;
begin
  try
    { TODO -oUser -cConsole Main : ここにコードを記述してください }
    Read(n);
    Readln(k);
    SetLength(l,n);
    for i := 0 to n - 1 do
      Read(l[i]);

    QuickSort1(l, Low(l), High(l));

    sum:=0;
    for i := n downto n-k do
      sum:=sum+l[i];

    Writeln(sum);
    Readln;
    Readln;
  except
    on E: Exception do
      Writeln(E.ClassName, ': ', E.Message);
  end;
end.