2171. 拿出最少数目的魔法豆

2171. 拿出最少数目的魔法豆

• 难度: medium
• 原始链接: https://leetcode.cn/problems/removing-minimum-number-of-magic-beans
• 标签: 排序, 前缀和

解法一: 排序, 前缀和

go

func minimumRemoval(beans []int) int64 {
    sort.Ints(beans)
    var sum int64 = 0
    var maxVal int64 = 0
    n := len(beans)
    for i, bean := range beans {
        sum += int64(bean)
        maxVal = max(maxVal, int64(n - i) * int64(bean))
    }
    return sum - maxVal
}