a,b=map(int,input().split())
t=[int(i) for i in input().split()]
count=0
t.sort()
for i in range(b):count+=t[i]
print(count)#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
int main()
{
ll n,k,a;cin>>n>>k;vector<ll> v;
while(n--){
cin>>a;v.pb(a);
}
ll ans = 0;
sort(v.begin(), v.end());
for(ll i = 0;i<k;i++){
ans+=v[i];
}
cout<<ans;
}443A - Anton and Letters | 1478B - Nezzar and Lucky Number |
228A - Is your horseshoe on the other hoof | 122A - Lucky Division |
1611C - Polycarp Recovers the Permutation | 432A - Choosing Teams |
758A - Holiday Of Equality | 1650C - Weight of the System of Nested Segments |
1097A - Gennady and a Card Game | 248A - Cupboards |
1641A - Great Sequence | 1537A - Arithmetic Array |
1370A - Maximum GCD | 149A - Business trip |
34A - Reconnaissance 2 | 59A - Word |
462B - Appleman and Card Game | 1560C - Infinity Table |
1605C - Dominant Character | 1399A - Remove Smallest |
208A - Dubstep | 1581A - CQXYM Count Permutations |
337A - Puzzles | 495A - Digital Counter |
796A - Buying A House | 67A - Partial Teacher |
116A - Tram | 1472B - Fair Division |
1281C - Cut and Paste | 141A - Amusing Joke |