// Package q3075 implements a solution for https://leetcode.com/problems/maximize-happiness-of-selected-children/
package q3075

import "slices"

func maximumHappinessSum(happiness []int, k int) int64 {
	slices.Sort(happiness)
	var sum int64
	for i := range k {
		sum += max(0, int64(happiness[len(happiness)-1-i]-i))
	}
	return sum
}

var _ = maximumHappinessSum