Submission #2250042

---

Source Code Expand

#include <iostream>
#include <algorithm>

using namespace std;

int main(){
    int N,K;
    int l[55];
    cin >> N >> K;
    for (int i=0;i<N;i++) cin >> l[i];
    sort(l,l+N,greater<int>());

    int ret=0;
    for (int i=0;i<K;i++) ret+=l[i];

    cout << ret << endl;

    return 0;
}

Submission Info

Judge Result