order k lists into one in O(nlogk) complexity

cant find a solution to this problem:
design an algorithm which takes as input a collection o k ordered(from min to max) lists (their elements were taken from a collection of n ordered numbers)and combines them to one ordered list. the complexity of the algorithm must be O(nlogk) n is the total number of the elements
Sign In or Register to comment.

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!