#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
// Fast I/O
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
if (!(cin >> n)) return 0;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int k;
cin >> k;
// Step 1: Sort in descending order to pick the largest happiness first
sort(arr.rbegin(), arr.rend());
ll totalHappiness = 0;
// Step 2: Select top k children while accounting for the turn penalty
for (int i = 0; i < k; i++) {
ll effectiveHappiness = arr[i] - i;
// If effective happiness becomes 0 or negative, remaining items won't add any value
if (effectiveHappiness <= 0) {
break;
}
totalHappiness += effectiveHappiness;
}
cout << "Maximum Happiness : " << totalHappiness << "\n";
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnR5cGVkZWYgbG9uZyBsb25nIGxsOwoKaW50IG1haW4oKSB7CiAgICAvLyBGYXN0IEkvTwogICAgaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKE5VTEwpOwoKICAgIGludCBuOwogICAgaWYgKCEoY2luID4+IG4pKSByZXR1cm4gMDsKCiAgICB2ZWN0b3I8aW50PiBhcnIobik7CiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgIGNpbiA+PiBhcnJbaV07CiAgICB9CgogICAgaW50IGs7CiAgICBjaW4gPj4gazsKCiAgICAvLyBTdGVwIDE6IFNvcnQgaW4gZGVzY2VuZGluZyBvcmRlciB0byBwaWNrIHRoZSBsYXJnZXN0IGhhcHBpbmVzcyBmaXJzdAogICAgc29ydChhcnIucmJlZ2luKCksIGFyci5yZW5kKCkpOwoKICAgIGxsIHRvdGFsSGFwcGluZXNzID0gMDsKCiAgICAvLyBTdGVwIDI6IFNlbGVjdCB0b3AgayBjaGlsZHJlbiB3aGlsZSBhY2NvdW50aW5nIGZvciB0aGUgdHVybiBwZW5hbHR5CiAgICBmb3IgKGludCBpID0gMDsgaSA8IGs7IGkrKykgewogICAgICAgIGxsIGVmZmVjdGl2ZUhhcHBpbmVzcyA9IGFycltpXSAtIGk7CgogICAgICAgIC8vIElmIGVmZmVjdGl2ZSBoYXBwaW5lc3MgYmVjb21lcyAwIG9yIG5lZ2F0aXZlLCByZW1haW5pbmcgaXRlbXMgd29uJ3QgYWRkIGFueSB2YWx1ZQogICAgICAgIGlmIChlZmZlY3RpdmVIYXBwaW5lc3MgPD0gMCkgewogICAgICAgICAgICBicmVhazsKICAgICAgICB9CgogICAgICAgIHRvdGFsSGFwcGluZXNzICs9IGVmZmVjdGl2ZUhhcHBpbmVzczsKICAgIH0KCiAgICBjb3V0IDw8ICJNYXhpbXVtIEhhcHBpbmVzcyA6ICIgPDwgdG90YWxIYXBwaW5lc3MgPDwgIlxuIjsKCiAgICByZXR1cm4gMDsKfQ==