I used three different algs, multiset , priority_queue, Divide and Conquer. These algs all are O(n log(k)) time complexity, where n is the total number of the all the lists. But!!! why my AC time is about 400ms, but i saw some guys' AC time is 50ms????
Have some alg better than O(nlog(k))??
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.