leetcode

0 class Solution {

1 public:

2 long long maximumHappinessSum(vector<int> &happiness, int k) const {

3 long long res = 0;

4

5 nth_element(begin(happiness), begin(happiness) + k, end(happiness), greater());

6 sort(begin(happiness), begin(happiness) + k, greater());

7

8 for (int i = 0; i < k; i++)

9 res += max(happiness[i] - i, 0);

10

11 return res;

12 }

13 };