#include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
int main() {
	int n;
	cin >> n;
 
	vector<int> arr(n);
 
	for(int i=0; i<n; i++) {
		cin >> arr[i];
	}
 
	int k;
	cin >> k;
 
	sort(arr.rbegin(), arr.rend());
 
	int maxHappiness = 0;
 
	for(int i=0; i<k; i++) {
		int currentHappiness = arr[i];
 
		if(currentHappiness <= 0) {
			break;
		}
 
		maxHappiness += currentHappiness;
	}
 
	cout << "Maximum Happiness : " << maxHappiness << endl;
 
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJaW50IG47CgljaW4gPj4gbjsKCQoJdmVjdG9yPGludD4gYXJyKG4pOwoJCglmb3IoaW50IGk9MDsgaTxuOyBpKyspIHsKCQljaW4gPj4gYXJyW2ldOwoJfQoJCglpbnQgazsKCWNpbiA+PiBrOwoJCglzb3J0KGFyci5yYmVnaW4oKSwgYXJyLnJlbmQoKSk7CgkKCWludCBtYXhIYXBwaW5lc3MgPSAwOwoKCWZvcihpbnQgaT0wOyBpPGs7IGkrKykgewoJCWludCBjdXJyZW50SGFwcGluZXNzID0gYXJyW2ldOwoJCQoJCWlmKGN1cnJlbnRIYXBwaW5lc3MgPD0gMCkgewoJCQlicmVhazsKCQl9CgkJCgkJbWF4SGFwcGluZXNzICs9IGN1cnJlbnRIYXBwaW5lc3M7Cgl9CgkKCWNvdXQgPDwgIk1heGltdW0gSGFwcGluZXNzIDogIiA8PCBtYXhIYXBwaW5lc3MgPDwgZW5kbDsKCQoJcmV0dXJuIDA7Cn0=

NQoxCjIKMwo0CjUKMg==

5
1
2
3
4
5
2