Merge k sorted array

#1

in the video lecture

please explain that how the comparision is happening

#2

@sk3657860 hey we have taken priority queue or minimum heap and it always give smaller element on top of it,so we push first element of each array in pq,then we extract the top and push in result and push the next element of extracted element in priority queue again.

#3

in custom pair how the comparing is occuring
that i want
please explain it

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.