Merging K- Sorted Lists using Priority Queue

Question

I have been asked in my algorithm class to make a K-way merge algorithm which is of O(nlogk) After searching i found it could be done via making a k length prio

Answer 1

1 list is exhausted when it has no more elements

2 you need to keep track from which list did the min element com

3 for each element you put it into a min heap of size k which takes logk so you have n times logk