#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define a first
#define b second
#define pb push_back
#include <crocodile.h>
llo mod=100000007;
llo travel_plan(llo n,llo m,llo r[][2],llo l[],llo k,llo p[]){
llo vis[n];
for(llo i=0;i<n;i++){
vis[i]=0;
}
for(llo i=0;i<k;i++){
vis[p[i]]=1;
}
vector<pair<llo,llo>> adj[n];
for(llo i=0;i<m;i++){
adj[r[i][0]].pb({r[i][1],l[i]});
adj[r[i][1]].pb({r[i][0],l[i]});
}
llo dist[n];
llo dist2[n];
for(llo i=0;i<n;i++){
dist[i]=-1;
dist2[i]=-1;
}
priority_queue<pair<llo,llo>> ac;
for(llo i=0;i<n;i++){
if(vis[i]==1){
dist[i]=0;
dist2[i]=0;
ac.push({0,i});
}
}
while(ac.size()){
pair<llo,llo> no=ac.top();
ac.pop();
no.a=-no.a;
for(auto j:adj[no.b]){
llo co=no.a+j.b;
if(dist[j.a]==-1 or dist[j.a]>=co){
dist2[j.a]=dist[j.a];
dist[j.a]=co;
if(dist2[j.a]!=-1){
ac.push({-dist2[j.a],j.a});
}
}
else if(dist2[j.a]==-1 or dist2[j.a]>co){
dist2[j.a]=co;
ac.push({-dist2[j.a],j.a});
}
}
}
return dist2[0];
}
/*llo main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
llo aa[7][2];
llo bb[7];
llo cc[2];
cc[0]=1;cc[1]=3;
bb[0]=4;bb[1]=3;bb[2]=2;bb[3]=10;bb[4]=100;
bb[5]=7;bb[6]=9;
aa[0][0]=0;aa[0][1]=2;
aa[1][0]=0;aa[1][1]=3;
aa[2][0]=3;aa[2][1]=2;
aa[3][0]=2;aa[3][1]=1;
aa[4][0]=0;aa[4][1]=1;
aa[5][0]=0;aa[5][1]=4;
aa[6][0]=3;aa[6][1]=4;
llo aa[4][2];
llo bb[4];
llo cc[3];
cc[0]=1;cc[1]=3;cc[2]=4;
bb[0]=2;bb[1]=3;bb[2]=1;bb[3]=4;
aa[0][0]=0;aa[0][1]=1;
aa[1][0]=0;aa[1][1]=2;
aa[2][0]=3;aa[2][1]=2;
aa[3][0]=2;aa[3][1]=4;
cout<<travel_plan(5,4,aa,bb,3,cc)<<endl;
return 0;
}*/
Compilation message
/tmp/cczRrqni.o: In function `main':
grader.cpp:(.text.startup+0x2d): undefined reference to `travel_plan(int, int, int (*) [2], int*, int, int*)'
collect2: error: ld returned 1 exit status
