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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
//SURSA NETERMINATA - DEBUGGING
#include <iostream>
#include <fstream>
using namespace std;


ifstream f("ubuntzei.in");
ofstream g("ubuntzei.out");



int main()
{
    int n, m, k, i, j, x, y, z;

    int c[2000], a[100][100];
    int mark[10000];
    f>>n>>m>>k;
int poz;
    for (i=1;i<=k;i++)
        f>>c[i];

    for (i=1;i<=m;i++)  {
            f>>x>>y>>z;
            a[x][y]=z;
            a[y][x]=z;
            mark[i]=-1;

        }
   mark[1]=0;
    long min1 = 100002;

    int marcate = 1, mark1[2000];
    while (marcate!=n)    {
        for (i=1;i<=n;i++)
            mark1[i] = 0;
         for (i=1;i<=n;i++) {
            if (mark[i] >= 0)   {
                for (j=1;j<=n;j++)
                    if (a[i][j] != 0 && (mark[j] == -1 )  )   {
                        mark1[j] = mark[i] + a[i][j];
                    }
            }
         }
          min1 = 100002;
            for (i=1;i<=n;i++)  {

                if (min1 > mark1[i] && mark1[i] != 0)    {
                    min1 = mark1[i];
                    poz = i;

                }
            }
mark[poz] = min1;
marcate++;
    }
            for (i=1;i<=n;i++)  {
                cout<<mark[i]<<" ";
            }

    cout<<endl<<min1;


    return 0;
    }