CCCPaste

Untitled


#include 
#include 
#include 
#include 
using namespace std;
struct node{
int index;
double distance;
node(){

}
node(int _index, double _distance){
index=_index;
distance=_distance;
}
bool operator <(const node& temp)const{
return distance>temp.distance;
}
};

int main()
{
int n;
cin>>n;
vector>v;
vector>graph[n];
for(int x=0; x>a;
    cin>>b;
    v.push_back(make_pair(a, b));
}
for(int y=0; ypq;
    pq.push(node(s, 0));
    bool visited [n];
    double distance[n];
    for(int h=0; h