//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops") //#pragma GCC target("avx,avx2") //#pragma GCC target("avx2") //#pragma GCC optimize("O3") //# include # include # include # include using namespace __gnu_pbds; using namespace std; template using ordered_set = tree , rb_tree_tag, tree_order_statistics_node_update>; #define _USE_MATH_DEFINES_ #define ll long long #define ld long double #define Accepted 0 #define pb push_back #define mp make_pair #define sz(x) (int)(x.size()) #define every(x) x.begin(),x.end() #define F first #define S second #define lb lower_bound #define ub upper_bound #define For(i,x,y) for (ll i = x; i <= y; i ++) #define FOr(i,x,y) for (ll i = x; i >= y; i --) #define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) // ROAD to... Red inline void Input_Output () { //freopen(".in", "r", stdin); //freopen(".out", "w", stdout); } const double eps = 0.000001; const ld pi = acos(-1); const int maxn = 1e7 + 9; const int mod = 1e9 + 7; const ll MOD = 1e18 + 9; const ll INF = 1e18 + 123; const int inf = 2e9 + 11; const int mxn = 1e6 + 9; const int N = 6e5 + 123; const int M = 22; const int pri = 997; const int Magic = 2101; const int dx[] = {-1, 0, 1, 0}; const int dy[] = {0, -1, 0, 1}; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int n, m, k; int cnt[N]; string s; int a[N]; vector < int > g[N]; int u[N]; int ans, res; int cur; int main () { SpeedForce; cin >> n >> k; For (i, 1, n) { cin >> a[i]; } sort(a + 1, a + n + 1); reverse(a + 1, a + n + 1); ll sum = 0; For (i, 1, k) { if(a[i] < 0) break; sum += a[i]; } cout << sum << '\n'; return Accepted; } // B...a