Perhaps the most counter-intuitive heap problem I’ve done so far.
Description
You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.
nums1
nums2
k