The time complexity for finding the kth smallest number in a min-heap
There is an $O(k)$ algorithm [1].

[1] Frederickson, G. N. (1993). An optimal algorithm for selection in a min-heap. Information and Computation, 104(2), 197-214.