1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
| // @Title: IPO (IPO)
// @Author: 15816537946@163.com
// @Date: 2021-09-08 23:53:17
// @Runtime: 164 ms
// @Memory: 11.9 MB
func findMaximizedCapital(k, w int, profits, capital []int) int {
n := len(profits)
type pair struct{ c, p int }
arr := make([]pair, n)
for i, p := range profits {
arr[i] = pair{capital[i], p}
}
sort.Slice(arr, func(i, j int) bool { return arr[i].c < arr[j].c })
h := &hp{}
for cur := 0; k > 0; k-- {
for cur < n && arr[cur].c <= w {
heap.Push(h, arr[cur].p)
cur++
}
if h.Len() == 0 {
break
}
w += heap.Pop(h).(int)
}
return w
}
type hp struct{ sort.IntSlice }
func (h hp) Less(i, j int) bool { return h.IntSlice[i] > h.IntSlice[j] }
func (h *hp) Push(v interface{}) { h.IntSlice = append(h.IntSlice, v.(int)) }
func (h *hp) Pop() interface{} {
a := h.IntSlice
v := a[len(a)-1]
h.IntSlice = a[:len(a)-1]
return v
}
|