I dont understand anything

#1

we make a min heap and insert first row.
i just understood till this point.
explain next steps

#2
  • The idea is to use min heap. Create a Min-Heap to store the elements
  • Traverse the first row from start to end and build a min heap of elements from first row. A heap entry also stores row number and column number.
  • Now Run a loop k times to extract min element from heap in each iteration
  • Get minimum element (or root) from Min-Heap.
  • Find row number and column number of the minimum element.
  • Replace root with the next element from same column and min-heapify the root.
  • Print the last extracted element, which is the kth minimum element
#3

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.