Welcome to the new platform of Programmers Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use it's exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
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