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++ (GCC 9.2.1) (judge verdict: Accepted)

#include<bits/stdc++.h>
#include<stdio.h>
#include<vector>

#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define vll vector<long long int>
#define endl "\n"
#define FOR(x) for(int i=0; i<x; i++)
#define sortV(x) sort(x.begin(), x.end())
#define sortA(x) sort(x, x+(sizeof(x)/sizeof(x[0])))
#define arrsige(x) (sizeof(x)/sizeof(x[0]))
#define vsige(x) x.size()
#define pb push_back
#define ll long long int
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define yess cout << "Yes" << endl
#define noo cout << "No" << endl


using namespace std;


void prnt(vector<long long int> v)
{
    cout << endl << endl << "vector size: " << v.size() << "  \nthe vector: " ;

    for(int i=0; i<v.size(); i++)
    {
        cout << v[i] << " ";
    }


    cout << endl << endl;
}


void solve()
{
    vll v;
    long long int n, k;
    cin >> n >> k;
    for(int i=0; i<n; i++)
    {
        long long int x;
        cin >> x;
        v.push_back(x);
    }

    long long int s=0;

    sortV(v);

    for(int i=0; i<k ;i++)
    {
        s+= v[i];
    }

    cout << s;
}




int main()
{
    IOS;
    int tc=1;
    //cin >> tc;
    while(tc--)
    {
        solve();
        cout << endl;
    }

    return 0;
}