Learn
Practice
Newsletter
Resources
Mobile
New
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Find K Pairs with Smallest Sums
Bookmark
Input
Example 1
Example 2
Example 3
Custom
nums1
=
[1, 7, 11]
,
nums2
=
[2, 4, 6]
,
k
=
3
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
result
pop the smallest sum k times, pushing each row's next pair
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
result
pop the smallest sum k times, pushing each row's next pair
found =
0
/ 3
heap size =
2
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
min-heap by sum
result
1+2
3
7+2
9
seed
(7, 2)
· sum
9
found =
0
/ 3
heap size =
3
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
min-heap by sum
result
1+2
3
7+2
9
11+2
13
seed
(11, 2)
· sum
13
found =
0
/ 3
heap size =
2
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
min-heap by sum
smallest
result
1+2
3
7+2
9
11+2
13
pop min
(1, 2)
· sum
3
found =
1
/ 3
heap size =
2
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
min-heap by sum
smallest
result
(1,2)
7+2
9
11+2
13
result +=
(1, 2)
·
1
/ 3
found =
1
/ 3
heap size =
2
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
min-heap by sum
smallest
result
(1,2)
7+2
9
11+2
13
1+4
5
pop min
(1, 4)
· sum
5
found =
2
/ 3
heap size =
2
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
min-heap by sum
smallest
result
(1,2)
7+2
9
11+2
13
(1,4)
result +=
(1, 4)
·
2
/ 3
found =
2
/ 3
heap size =
2
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
min-heap by sum
smallest
result
(1,2)
7+2
9
11+2
13
(1,4)
1+6
7
pop min
(1, 6)
· sum
7
found =
3
/ 3
heap size =
2
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
min-heap by sum
smallest
result
(1,2)
7+2
9
11+2
13
(1,4)
(1,6)
result +=
(1, 6)
·
3
/ 3
found =
3
/ 3
heap size =
2
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
min-heap by sum
result
(1,2)
7+2
9
11+2
13
(1,4)
(1,6)
result = [(1,2) (1,4) (1,6)]
algo
master
.
io
Step:
Find the 3 pairs (a, b) with the smallest sums, one value from each sorted array
0 / 14
Input
Example 1
Example 2
Example 3
Custom
nums1
=
[1, 7, 11]
,
nums2
=
[2, 4, 6]
,
k
=
3
0 / 14
algo
master
.
io
Step:
Find the 3 pairs (a, b) with the smallest sums, one value from each sorted array
