Submission #1516587

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

int main(){

  int n, k, ans = 0;
  int l[55];

  cin >> n >> k;

  for(int i = 0; i < n; i++){
    cin >> l[i];
  }
  sort(l, l+n);
  int j = n-1;
  for(int i = 0; i < k; i++){
    ans += l[j];
    j--;
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result