Then, if I were to merge them sequentially, ie merge first two, then the third with the first two, the running time would be O(kn), since, the first two will take n comparisons, making a merged list of 2n elements,

then compare to the next list of n elements takes n comparisons, and latch on the rest of the 2n list.