Pagini recente » Profil CiurelVictor | Cod sursa (job #2743698) | Cod sursa (job #88883) | Cod sursa (job #1768531) | Cod sursa (job #1120189)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ubuntzei.in");
ofstream g("ubuntzei.out");
int vizitat[1000],a[1000][1000];
int n,m,i,k;
int cost_total,cost[1000][1000];
int orase[1000];
void DFS(int X)
{
vizitat[X]=1;
int i;
for(i=1; i<=n; i++)
{
if(a[X][i])
if(vizitat[i]==0)
{
DFS(i);
cost_total+=cost[X][i];
}
}
}
int main()
{
f>>n>>m>>k;
for(i=1; i<=k; i++)
f>>orase[i];
for(i=1; i<=m; i++)
{
int x,y,c;
f>>x>>y>>c;
a[x][y]=a[y][x]=1;
cost[x][y]=cost[y][x]=c;
}
DFS(1);
g<<cost_total;
return 0;
}