What can be wrong in this implementation of dijkstra algorithm? s is the source, t is destination, n is no. of vertices

Question

adj is the adjacency list, cost has weights of the edges. I have used set instead of priority queue.

long long distance(vector > &