output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
      l_1 l_2 l_3 ... l_{N}
attempt: I = lambda: map(int, input().split())
  _, K = I()
  print(sum(sorted(I())[-K:]))
  
problem_description: 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.
samples: [{"input": "5 3\n    1 2 3 4 5", "output": "12\n    \n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5,\nwhich is the maximum possible length.\n\n* * *"}, {"input": "15 14\n    50 26 27 21 41 7 42 35 7 5 5 36 39 1 45", "output": "386"}]