#include <bits/stdc++.h>

using namespace std;

int main() {
    int N, K;
    cin >> N >> K;

    vector<int> vt(N);
    int cnt = 0;
    for (int i = 0; i < N; ++i) {
        cin >> vt[i];
        if (vt[i] > 0) cnt++;
    }
    sort(vt.begin(), vt.end(), greater<>());

    if (cnt == 0) {
        cout << vt[0] << endl;
    } else {
        cout << accumulate(vt.begin(), vt.begin() + min(K, cnt), 0) << endl;
    }
    return 0;
}