Problem:
Score : 200 points

Problem 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.

Constraints

1 \leq K \leq N \leq 1000

1 \leq p_i \leq 1000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K
p_1 p_2 \ldots p_N

Output

Print an integer representing the minimum possible total price of fruits.

Sample Input 1

5 3
50 100 80 120 80

Sample Output 1

210

This shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.

The minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.

Sample Input 2

1 1
1000

Sample Output 2

1000

Solution in C# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.Collections.Generic;

namespace MixJuce
{
    class Program
    {
        static void Main(string[] args)
        {
            int N, K;

            string inD0 = Console.ReadLine();
            string[] cngD0 = inD0.Split(' ');

            int[] p = new int[1001];

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

            N = int.Parse(cngD0[0]);
            K = int.Parse(cngD0[1]);

            string inD1 = Console.ReadLine();
            string[] cngD1 = inD1.Split(' ');

            for (int i = 0; i <= N - 1; i++)
            {
                p[i] = int.Parse(cngD1[i]);
                list.Add(p[i]);

            }

            int cnt = list.Count;

            list.Sort();

            var res = 0;
            int cnt_p = 0;
            foreach(int val in list)
            {
                res += val;
                cnt_p++ ;
                if (cnt_p >= K) break;
            }

            Console.WriteLine(res);
        }


    }
}