Suppose there are k sorted lists (decreasing order) with n/k elements in each list.
What is the time complexity to merge them into one single sorted list.
Hint: Maintain a heap of k elements. Think which k elements to choose.
A. O(nlogk)
B. O(n)
C. O(nk)
D. O(nlogn)