✅✔️Easy Peasy Solution ✈️✈️✈️
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    long long maximumHappinessSum(vector<int>& arr, int k) {\n        int n = arr.size();\n        long long ans = 0;\n        sort(arr.begin(),arr.end(),greater<int>());\n        int x = 0;\n        for(int i=0; i<k; i++) {\n            arr[i] = max(0,arr[i]-x);\n            x++;\n        }\n        for(int i=0; i<k; i++) ans += arr[i];\n        return ans;\n    }\n};\n```
['Array', 'Greedy', 'Sorting', 'C++']