in this implementation the comparison in min heap is done by the first value of pair?? without overloading??
Merke k sorted arrays
Hello @shampblocks,
In case of pairs the default way of comparison is by comparing their first values.
Hope, this would help.
if first value was pair itself rather then int then we have to overload that??
Hello @shampblocks,
You can refer to the following code:
Let me know if you do not understand something.
Suggestion:
Code things and try them yourself.
Hope, this would help.
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.