Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit d7337bd

Browse files
Create maximum-performance-of-a-team.go
1 parent b5cb84e commit d7337bd

File tree

1 file changed

+57
-0
lines changed

1 file changed

+57
-0
lines changed
Lines changed: 57 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,57 @@
1+
//https://leetcode.com/problems/maximum-performance-of-a-team/
2+
3+
package maximum_performance_of_a_team
4+
5+
import (
6+
"container/heap"
7+
"sort"
8+
)
9+
10+
type Engineer struct {
11+
Speed int
12+
Efficiency int
13+
}
14+
15+
func maxPerformance(n int, speed []int, efficiency []int, k int) int {
16+
engs := make([]Engineer, n)
17+
for i := 0; i < n; i++ {
18+
engs[i] = Engineer{speed[i], efficiency[i]}
19+
}
20+
sort.Slice(engs, func(i, j int) bool {
21+
return engs[i].Efficiency > engs[j].Efficiency
22+
})
23+
speedHeap := &IntHeap{}
24+
heap.Init(speedHeap)
25+
speedSum := 0
26+
ret := 0
27+
for _, eng := range engs {
28+
heap.Push(speedHeap, eng.Speed)
29+
speedSum += eng.Speed
30+
if speedHeap.Len() > k {
31+
speedSum -= heap.Pop(speedHeap).(int)
32+
}
33+
ret = max(ret, speedSum*eng.Efficiency)
34+
}
35+
return ret % (1e9 + 7)
36+
}
37+
38+
func max(a, b int) int {
39+
if a > b {
40+
return a
41+
}
42+
return b
43+
}
44+
45+
type IntHeap []int
46+
47+
func (h IntHeap) Len() int { return len(h) }
48+
func (h IntHeap) Less(i, j int) bool { return h[i] < h[j] }
49+
func (h IntHeap) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
50+
func (h *IntHeap) Push(x interface{}) { *h = append(*h, x.(int)) }
51+
func (h *IntHeap) Pop() interface{} {
52+
old := *h
53+
n := len(old)
54+
x := old[n-1]
55+
*h = old[0 : n-1]
56+
return x
57+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /