#include <bits/stdc++.h>

using namespace std;

int main(){

  int N, K ;
  cin >> N >> K;

  int array[N];
  for(int i = 0;i < N ; i++){
    cin >> array[i];
  }

  for(int i = 0;i < N ; i++){
    int max = i;
    for(int j = i+1;j < N;j++){
      if(array[max] < array[j]){
	max = j;

      }

    }
          swap(array[i],array[max]);
  }
  /*for (int i = 0; i < N ;i++){
    cout <<array[i];
    } */
  
  int sum = 0;
  for(int i = 0;i < K;i++){

    sum += array[i];
  }
  
  cout << sum << endl;
    
  return 0;
}

#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...)  cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif

void d_err() {
    cerr << endl;
}

template <typename H, typename... T>
void d_err(H h, T... t) {
    cerr << h << " ";
    d_err(t...);
}

template <typename T>
void print(T x) {
    cout << x << "\n";
}

#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (ll i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (ll i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;

ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9+7;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    int n, k; cin >> n >> k;
    vi l(n); REP(i, n) cin >> l[i];

    sort(ALL(l), greater<>());
    int ans = accumulate(l.begin(), l.begin() + k, 0);

    print(ans);
}