-
Notifications
You must be signed in to change notification settings - Fork 0
/
10423.cpp
46 lines (46 loc) · 1.05 KB
/
10423.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#include <cstdio>
#include <queue>
#include <algorithm>
#include <vector>
#include <functional>
using namespace std;
int N,M,K;
vector<pair<int,int>> adj[1001];
vector<int> p;
bool visit[1001];
int main(){
scanf("%d%d%d",&N,&M,&K);
for(int i=0;i<K;i++){
int v;
scanf("%d",&v);
p.push_back(v);
}
for(int i=0;i<M;i++){
int a,b,w;
scanf("%d%d%d",&a,&b,&w);
adj[a].push_back({b,w});
adj[b].push_back({a,w});
}
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
for(auto a : p) {
for(auto e : adj[a]){
pq.push({e.second,e.first});
}
visit[a]=1;
}
int ans = 0,cnt=p.size();
while(!pq.empty()){
auto qt = pq.top(); pq.pop();
int cur = qt.second;
if(visit[cur]) continue;
visit[cur]=1;
ans+=qt.first;
if(++cnt==N) break;
for(auto e : adj[cur]){
int nxt=e.first;
int w=e.second;
pq.push({w,nxt});
}
}
printf("%d",ans);
}