B - Mix Juice.cpp

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

void solve()
{
    int n, k;
    cin >> n >> k;
    vector<int>p(n);
    for (int i = 0; i < n; i++)
        cin >> p[i];
    sort(p.begin(), p.end());

    int res = 0;
    for (int i = 0; i < k; i++)
        res += p[i];
    cout << res;
}
int main()
{
    solve();
    return 0;
}