DIJKSTRA

#include <iostream>

using namespace std;

int n, m;
int minn;
int u;
int dis[100010], book[100010], t1, t2, t3, e[10010][10010];

int main(){
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j ++)
            if(i == j) e[i][j] = 0;
            else e[i][j] = 999999999;
    for(int i = 1; i <= m; i ++){
        cin >> t1 >> t2 >> t3;
        e[t1][t2] = t3;
    }
    for(int i = 1; i <= n; i ++) dis[i] = e[1][i];
    for(int i = 1; i <= n; i ++) book[i] = 0;
    book[1] = 1;
    for(int i = 1; i <= n; i ++){
        minn = 999999999;
        for(int j = 1; j <= n; j ++){
            if(book[j] == 0 && dis[j] < minn){
                minn = dis[j];
                u = j;
            }
        }
        book[u] = 1;
        for(int j = 1; j <= n; j ++){
            if(e[u][j] < 999999999){
                if(dis[j] > dis[u] + e[u][j]) dis[j] = dis[u] + e[u][j];
            }
        }
    }
    for(int i = 1; i <= n; i ++) cout << dis[i];
    return 0;
}