#include<deque>
#include<stdio.h>
#include<algorithm>
using namespace std;
void read(),solve();
deque<int>q;
int i,x[5000010],s=0,k,n;
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	freopen("deque.in","r",stdin);
	freopen("deque.out","w",stdout);
	scanf("%d%d",&n,&k);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&x[i]);
		q.push_front(x[i]);
	}
}
void solve()
{
	sort(q.begin(),q.end());
	for(i=0;i<=k;i++)
		s+=q[i];
	printf("%d",s);
}