m, n = map(int, input().split())
prices = list(map(int, input().split()))
prices = sorted(prices)
total = 0
for p in range(n):
if prices[p] < 0:
total += prices[p]
print(total * -1)#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int arr[n];
int ans = 0;
for(int i = 0 ; i < n ; i++){
cin >> arr[i];
}
sort(arr , arr + n);
for(int i = 0 ; i < m ; i++){
if(arr[i] < 0){
ans = ans + abs(arr[i]);
}
}
cout << ans << endl;
return 0;
}
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |