#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
 
int main() {
  ll N = 0,K = 0,ans = 0;
  cin >> N >> K;
  vector<int>vec(N);
  rep(i,N){
    cin >> vec[i];
  }
  sort(vec.begin(), vec.end());
  reverse(vec.begin(), vec.end());
  ans += vec[0];
  rep(i,K - 1){
    if(vec[i + 1] < 1){
      break;
    }
    ans += vec[i + 1];
  }
  cout << ans << endl;
}