Merge k sorted arrays
Merge several sorted arrays into one sorted array with a min-heap holding one element from each array. Give the O(N log k) cost and compare with pairwise merging.
MicrosoftCodingNo answer yet. Write the first one; the best answer gets endorsed.