mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-08-03 02:47:26 +08:00
21 lines
273 B
Go
21 lines
273 B
Go
package leetcode
|
|
|
|
import "sort"
|
|
|
|
func minimumRemoval(beans []int) int64 {
|
|
sort.Ints(beans)
|
|
sum, mx := 0, 0
|
|
for i, v := range beans {
|
|
sum += v
|
|
mx = max(mx, (len(beans)-i)*v)
|
|
}
|
|
return int64(sum - mx)
|
|
}
|
|
|
|
func max(a, b int) int {
|
|
if b > a {
|
|
return b
|
|
}
|
|
return a
|
|
}
|