I wrote a C++ code for a question in which I need to use Dijkstra\'s shortest path algorithm in n*log(n) time and so I am using set of pairs to obtain the vertex with shorte