Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Maximum Performance of a Team
Bookmark
Brute Force
Sort + Min-Heap
Input
Example 1
k=3
Small
Custom
speed
=
[2, 10, 3, 1, 5, 8]
,
efficiency
=
[5, 4, 3, 9, 7, 2]
,
k
=
2
E0
eff
5
spd
2
E1
eff
4
spd
10
E2
eff
3
spd
3
E3
eff
9
spd
1
E4
eff
7
spd
5
E5
eff
2
spd
8
performance = sum of speeds × the team's minimum efficiency
E0
eff
5
spd
2
E1
eff
4
spd
10
E2
eff
3
spd
3
E3
eff
9
spd
1
E4
eff
7
spd
5
E5
eff
2
spd
8
performance = sum of speeds × the team's minimum efficiency
speedSum =
12
maxPerf =
48
E0
eff
5
spd
2
E1
eff
4
spd
10
E2
eff
3
spd
3
E3
eff
9
spd
1
E4
eff
7
spd
5
E5
eff
2
spd
8
team, k = 2 (min-heap by speed):
2
E0
10
E1
10
48
perf =
12
×
=
48
→ new best!
speedSum =
7
maxPerf =
48
E0
eff
5
spd
2
E1
eff
4
spd
10
E2
eff
3
spd
3
E3
eff
9
spd
1
E4
eff
7
spd
5
E5
eff
2
spd
8
team, k = 2 (min-heap by speed):
2
E0
5
E4
10
48
15
15
E4
added to the team, speedSum =
7
speedSum =
10
maxPerf =
48
E0
eff
5
spd
2
E1
eff
4
spd
10
E2
eff
3
spd
3
E3
eff
9
spd
1
E4
eff
7
spd
5
E5
eff
2
spd
8
team, k = 2 (min-heap by speed):
10
E1
10
48
15
15
35
20
speedSum =
10
maxPerf =
48
E0
eff
5
spd
2
E1
eff
4
spd
10
E2
eff
3
spd
3
E3
eff
9
spd
1
E4
eff
7
spd
5
E5
eff
2
spd
8
team, k = 2 (min-heap by speed):
10
E1
10
48
15
15
35
20
40
39
44
consider
E4
for the team
speedSum =
3
maxPerf =
60
E0
eff
5
spd
2
E1
eff
4
spd
10
E2
eff
3
spd
3
E3
eff
9
spd
1
E4
eff
7
spd
5
E5
eff
2
spd
8
team, k = 2 (min-heap by speed):
3
E2
10
48
15
15
35
20
40
39
44
60
36
team
E2
, minEff
3
speedSum =
8
maxPerf =
60
E0
eff
5
spd
2
E1
eff
4
spd
10
E2
eff
3
spd
3
E3
eff
9
spd
1
E4
eff
7
spd
5
E5
eff
2
spd
8
team, k = 2 (min-heap by speed):
3
E2
5
E4
10
48
15
15
35
20
40
39
44
60
36
9
12
24
speedSum =
6
maxPerf =
60
E0
eff
5
spd
2
E1
eff
4
spd
10
E2
eff
3
spd
3
E3
eff
9
spd
1
E4
eff
7
spd
5
E5
eff
2
spd
8
team, k = 2 (min-heap by speed):
1
E3
5
E4
10
48
15
15
35
20
40
39
44
60
36
9
12
24
22
9
E4
added to the team, speedSum =
6
speedSum =
5
maxPerf =
60
E0
eff
5
spd
2
E1
eff
4
spd
10
E2
eff
3
spd
3
E3
eff
9
spd
1
E4
eff
7
spd
5
E5
eff
2
spd
8
team, k = 2 (min-heap by speed):
5
E4
10
48
15
15
35
20
40
39
44
60
36
9
12
24
22
9
42
18
35
perf =
5
×
=
35
≤ best (60)
speedSum =
0
maxPerf =
60
E0
eff
5
spd
2
E1
eff
4
spd
10
E2
eff
3
spd
3
E3
eff
9
spd
1
E4
eff
7
spd
5
E5
eff
2
spd
8
team, k = 2 (min-heap by speed):
10
48
15
15
35
20
40
39
44
60
36
9
12
24
22
9
42
18
35
26
16
max performance = 60
algo
master
.
io
Step:
Start: 6 engineers, teams of up to 2
0 / 130
Input
Example 1
k=3
Small
Custom
speed
=
[2, 10, 3, 1, 5, 8]
,
efficiency
=
[5, 4, 3, 9, 7, 2]
,
k
=
2
0 / 130
algo
master
.
io
Step:
Start: 6 engineers, teams of up to 2
