I want to know the time complexity of my solution!

#1

i want to know the time complexity of my solution!

#2

Everytime you start with fresh pq, make update in m and then insert all entries in pq.
This process repeats N times, so your code has complexity of O(NxNxlogN).

#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.