Go: package main

import (
	"bufio"
	"fmt"
	"os"
)

func main() {
	r := bufio.NewReader(os.Stdin)

	var n int
	fmt.Fscan(r, &n)
	cs := make([]map[int]int, n) // []v_i -> c_i
	for h := 0; h < n; h++ {
		var u, k int
		fmt.Fscan(r, &u, &k)
		m := make(map[int]int)
		for i := 0; i < k; i++ {
			var v, c int
			fmt.Fscan(r, &v, &c)
			m[v] = c
		}

		cs[u] = m
	}

	q := make(map[int]int)
	q[0] = 0
	visited := make(map[int]struct{})
	out := make([]int, n)

	for len(q) > 0 {
		u := top(q)
		for uu, c := range cs[u] {
			// Consider the connection between u and uu.
			if _, ok := visited[uu]; ok {
				continue
			}
			if d, ok := q[uu]; !ok || d > q[u]+c {
				q[uu] = q[u] + c
			}
		}

		out[u] = q[u]
		delete(q, u)
		visited[u] = struct{}{}
	}

	for u, d := range out {
		fmt.Println(u, d)
	}
}

func top(q map[int]int) int {
	minu := -1
	min := -1
	for u, d := range q {
		if min < 0 || d < min {
			minu = u
			min = d
		}
	}

	return minu
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()
#define INF 1<<20

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int cost[105][105];
int d[105];
bool used[105];

int dijkstra (int n )
{
	memset (used, false, sizeof (used ) );
	fill (d, d+n, INF );
	d[0] = 0;

	while (true ){
		int v = -1;
		// まだ使われていない頂点のうち距離が最小のものを探す
		rep (u, n )
			if (!used[u] && (v == -1 || d[u] < d[v] ) ) v = u;
		
		if (v == -1 ) break;
		
		used[v] = true;
		rep (u, n )
			d[u] = min (d[u], d[v] + cost[v][u] );
	} // end whle
}

int main()
{
	ios_base::sync_with_stdio(0);
	int n; cin >> n;
	rep (i, n ) rep (j, n ) cost[i][j] = INF;

	rep (i, n ){
		int u; cin >> u;
		int k; cin >> k;
		while (k-- ){
			int v, c; cin >> v >> c;
			cost[u][v] = c;
		} // end while
	} // end loop

	dijkstra (n );
	rep (i, n ) cout << i << ' ' << d[i] << endl;
		
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <map>
#include <queue>


void update(int node, std::vector<int>& weight, const std::vector<std::map<int, int>> link_list) {
    for (auto && l : link_list[node]) {
        if (weight[l.first] == -1 || weight[node] + l.second < weight[l.first]) {
            weight[l.first] = weight[node] + l.second;
            update(l.first, weight, link_list);
        }
    }
}


int main() {
    int n;
    std::cin >> n;

    std::vector<std::map<int, int>> link_list;
    for (int i = 0; i < n; i++) {
        int u, k;
        std::cin >> u >> k;
        std::map<int, int> map;
        for (int j = 0; j < k; j++) {
            int c, v;
            std::cin >> c >> v;
            map[c] = v;
        }
        link_list.emplace_back(map);
    }

    std::vector<int> weight(n, -1);
    weight[0] = 0;

    auto comp = [] (std::tuple<int, int, int> &lfs, std::tuple<int, int, int> &rhs) {
        return std::get<2>(lfs) > std::get<2>(rhs);
    };
    
    std::priority_queue<std::tuple<int, int, int>, std::vector<std::tuple<int, int, int>>, decltype(comp)> que(comp);
    for (auto && m : link_list[0]) {
        que.push(std::make_tuple(0, m.first, m.second));
    }

    while (!que.empty()) {
        auto val = que.top();
        que.pop();
        auto w = weight[std::get<0>(val)] + std::get<2>(val);
        if (weight[std::get<1>(val)] == -1 || w < weight[std::get<1>(val)]) {
            weight[std::get<1>(val)] = w;
            for (auto && m : link_list[std::get<1>(val)]) {
                que.push(std::make_tuple(std::get<1>(val), m.first, m.second));
            }
        }
    }

    for (int i = 0; i < n; i++) {
        std::cout << i << " " << weight[i] << std::endl;
    }
}

C++: #include<iostream>
using namespace std;

#define N 100
#define MAX 100001
#define che cout<<"-----"<<endl

int cnt = 0;

class Po{
public:
    int i;
    int d;
    int o;
};

void change(Po *a, int i);
void maxHeapify(Po *a, int i);
void buildMaxHeap(Po *a, int n);

int main() {
    
    Po a[N][N];
    int n, u, k, c, v;
    cin>>n;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            a[i][j].d = MAX;
        }
    }
    
    for(int i = 0; i < n; i++) {
        cin>>u>>k;
        for(int j = 0; j < k; j++) {
            cin>>c>>v;
            a[u][c].d = v;
            a[u][c].i = c;
            a[u][c].o = u;
        }
    }
    
    int list[N];
//    for(int i = 0; i < n; i++) list[i] = MAX;
    list[0] = 0;
    Po q[100000], mini;
    for(int i = 1; i < n; i++) {
        if(a[0][i].d != MAX) {
            cnt++;
            q[cnt] = a[0][i];
            change(q, cnt);
        }
    }
    
    int num = 0;
    while(1) {
        mini = q[1];
        q[1] = q[cnt];
        cnt--;
        maxHeapify(q, 1);
        if(list[ mini.i ] == 0) {
            list[ mini.i ] = mini.d;
            for(int i = 1; i < n; i++) {
                if(a[mini.i][i].d != MAX) {
                    cnt++;
                    a[mini.i][i].d += mini.d;
                    q[cnt] = a[mini.i][i];
                    change(q, cnt);
                }
            }
            num++;
        }
        if(num == n-1) break;
    }
    
    for(int i = 0; i < n; i++) {
        cout<<i<<' '<<list[i]<<endl;
    }
    
    return 0;
}

void change(Po *a, int i) {
    int p = i % 2 == 0 ? i/2 : (i-1)/2;
    if(p >= 1 && a[i].d < a[p].d ) {
        Po tmp = a[i];
        a[i] = a[p];
        a[p] = tmp;
        change(a, p);
    }
}

void maxHeapify(Po *a, int i) {

  int l = i*2;
  int r = i*2+1;

  int largest = i;
  if(l <= cnt && a[l].d < a[largest].d )  largest = l;

  if(r <= cnt && a[r].d < a[largest].d ) largest = r;

  if(largest != i) {
    Po s = a[i];
    a[i] = a[largest];
    a[largest] = s;
    maxHeapify(a, largest);
  }
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#define MAX_V 100
#define INF 1e9
using namespace std;
int cost[MAX_V][MAX_V];
int d[MAX_V];
bool used[MAX_V];
int V;
void dijkstra(int s) {
	for (int i = 0; i < V; i++) {
		d[i] = INF;
		used[i] = false;
	}
	d[s] = 0;
	while (true) {
		int v = -1;
		for (int u = 0; u < V; u++) {
			if (!used[u] && ((v == -1) || d[u] < d[v])) {
				v = u;
			}
		}
		//全ての頂点が到達済み
		if (v == -1) {
			break;
		}
		//集合に新たに頂点を追加
		used[v] = true;
		for (int u = 0; u < V; u++) {
			d[u] = min(d[u], d[v] + cost[v][u]);
		}
	}
}

int main() {
	for (int i = 0; i < V+80; i++) {
		for (int j = 0; j < V+80; j++) {
			cost[i][j] = INF;//iからjへの辺の重さ
		}
	}
	cin >> V;
	for (int i = 0; i < V; i++) {
		int u;
		cin >> u;
		int k;
		cin >> k;
		for (int j = 0; j < k; j++) {
			int v;
			cin >> v;
			int c;
			cin >> c;
			cost[u][v] = c;
		}
	}
	dijkstra(0);

	for (int i = 0; i < V; i++) {
		cout << i << " " << d[i] << endl;
	}
	return 0;
}