Learn Js

 Learn Js Solutions

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

vector<pair<int,int>>adj[1000001];

int main() {
	int n;
	cin >> n;    
		unordered_map<int, int>mp;
		for(int i =0;i<n;++i){
			int x;
			cin>>x;
			mp[x] =INT_MAX;
		}
		int e;
		cin>>e;
		for(int i =0;i<e;++i){
			int x,y,d;
			cin>>x>>y>>d;
			adj[x].push_back({y,d});
			
		}

		int src,dest;
		cin>>src>>dest;
		set<pair<int,int>>s;
		mp[src]=0;
		s.insert({0, src});
		while(!s.empty()){
			pair<int, int>tmp=*(s.begin());
			s.erase(s.begin());
			int u = tmp.second;
			for(auto i = adj[u].begin();i!=adj[u].end();++i){
				int v = (*i).first;
				int weight = (*i).second;
				if(mp[v]>mp[u]+weight){
					if(mp[v]!=INT_MAX)
						s.erase(s.find({mp[v],v}));
					mp[v] = mp[u]+weight;
					s.insert({mp[v],v});
				}
			}
		}
		if(mp[dest]==INT_MAX)
			cout<<-1<<endl;
		else
			cout<<mp[dest]<<endl;

		return 0;
}