output_description: Print an integer representing the minimum possible total price of fruits.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
      p_1 p_2 \ldots p_N
attempt: a, b = input().split(" ")
  lst = list(map(int, input().split(" ")))
  lst_s = sorted(lst)
  res = lst_s[0 : int(b)]
  print(sum(res))
  
problem_description: Statement
  
  A shop sells N kinds of fruits, Fruit 1, \ldots, N, at prices of p_1, \ldots,
  p_N yen per item, respectively. (Yen is the currency of Japan.)
  
  Here, we will choose K kinds of fruits and buy one of each chosen kind. Find
  the minimum possible total price of those fruits.
samples: [{"input": "5 3\n    50 100 80 120 80", "output": "210\n    \n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen,\nand 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen\nwhen choosing Fruit 1, 3, and 5.\n\n* * *"}, {"input": "1 1\n    1000", "output": "1000"}]