#include <bits/stdc++.h>
#include <string.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define srep(i,a,b) for(int i = a; i < b; i++)
#define all(A) (A).begin(),A.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
using P = pair<char,int>;
using Graph = vector<vector<int>>;

int main(void){
	int n,k; cin >> n >> k;
	vector<int> A(n); rep(i,n) cin >> A[i];
	sort(all(A),greater<int>());

	int sum = A[0];
	rep(i,k-1) sum = max(sum+A[i+1],sum);
	cout << sum << endl;
}