#include #include #define rep(i,n) for(int i = 0; i < n; i++) #define srep(i,a,b) for(int i = a; i < b; i++) #define all(A) (A).begin(),A.end() #define MOD 1000000007 using namespace std; using ll = long long; using P = pair; using Graph = vector>; int main(void){ int n,k; cin >> n >> k; vector A(n); rep(i,n) cin >> A[i]; sort(all(A),greater()); int sum = A[0]; rep(i,k) sum = max(sum+A[i],sum); cout << sum << endl; }