09may.txt

class Solution {
    public long maximumHappinessSum(int[] happiness, int k) {
        // Sort the array in ascending order
        Arrays.sort(happiness);

        // Reverse the array to get descending order
        reverseArray(happiness);

        int selected = 0;
        long happinessScore = 0; // Changed to 'long' to handle larger sums

        // Iterate over the sorted happiness values
        for (int score : happiness) {
            if (selected == k) {
                break; // Stop if 'k' elements have been selected
            }
            // Calculate and add the adjusted happiness value if it's positive
            happinessScore += Math.max(0, score - selected);
            selected++;
        }

        return happinessScore;
    }

    // Helper method to reverse the array
    private void reverseArray(int[] array) {
        for (int i = 0, j = array.length - 1; i < j; i++, j--) {
            int temp = array[i];
            array[i] = array[j];
            array[j] = temp;
        }
    }
}