22 lines
439 B
Go
22 lines
439 B
Go
// Package q3074 implements a solution for https://leetcode.com/problems/apple-redistribution-into-boxes/
|
|
package q3074
|
|
|
|
import "slices"
|
|
|
|
func minimumBoxes(apple []int, capacity []int) int {
|
|
apples := 0
|
|
for _, a := range apple {
|
|
apples += a
|
|
}
|
|
|
|
slices.Sort(capacity)
|
|
for i := len(capacity) - 1; i >= 0; i-- {
|
|
apples -= capacity[i]
|
|
if apples <= 0 {
|
|
return len(capacity) - i
|
|
}
|
|
}
|
|
return len(capacity)
|
|
}
|
|
|
|
var _ = minimumBoxes
|