Go: package main

import (
	"bufio"
	"container/heap"
	"fmt"
	"os"
)

type Item struct {
	value    int // The value of the item; arbitrary.
	priority int // The priority of the item in the queue.
	// The index is needed by update and is maintained by the heap.Interface methods.
	index int // The index of the item in the heap.
}
type PriorityQueue []*Item

func (pq PriorityQueue) Len() int { return len(pq) }
func (pq PriorityQueue) Less(i, j int) bool {
	return pq[i].priority < pq[j].priority
}
func (pq PriorityQueue) Swap(i, j int) {
	pq[i], pq[j] = pq[j], pq[i]
	pq[i].index = i
	pq[j].index = j
}
func (pq *PriorityQueue) Push(x interface{}) {
	n := len(*pq)
	item := x.(*Item)
	item.index = n
	*pq = append(*pq, item)
}
func (pq *PriorityQueue) Pop() interface{} {
	old := *pq
	n := len(old)
	item := old[n-1]
	item.index = -1 // for safety
	*pq = old[0 : n-1]
	return item
}

type Q struct {
	pq *PriorityQueue
	ds map[int]int // It has always same value as pq. For random access.
}

func newQ() *Q {
	pq := new(PriorityQueue)
	heap.Init(pq)
	return &Q{
		pq: pq,
		ds: make(map[int]int),
	}
}
func (q *Q) pop() (u, d int) {
	item := heap.Pop(q.pq).(*Item)
	delete(q.ds, item.value)
	return item.value, item.priority
}
func (q *Q) get(u int) (int, bool) { // returns d
	d, ok := q.ds[u]
	return d, ok
}
func (q *Q) set(u, d int) {
	q.ds[u] = d
	for _, item := range *q.pq {
		if item.value != u {
			continue
		}

		item.priority = d
		heap.Fix(q.pq, item.index)
		return
	}
	heap.Push(q.pq, &Item{
		priority: d,
		value:    u,
	})
}
func (q *Q) len() int {
	return len(q.ds)
}

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 := newQ()
	q.set(0, 0)
	visited := make(map[int]struct{})
	out := make([]int, n)

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

		out[u] = d
		visited[u] = struct{}{}
	}

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

C++: import java.util.Arrays;
import java.util.Scanner;

public class Main {
	static int N;
	static int W[][], distance[], state[];
	static final int INF = 1000000000;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();

		W = new int[N][N];
		distance = new int[N];
		state = new int[N];

		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				W[i][j] = INF;
			}
		}

		for (int i = 0; i < N; i++) {
			sc.nextInt(); // u を読み飛ばし
			int k = sc.nextInt();
			for (int j = 0; j < k; j++) {
				int v = sc.nextInt();
				int c = sc.nextInt();
				W[i][v] = c;
			}
		}
		dijkstra(0);
		for (int i = 0; i < N; i++) {
			System.out.println(i + " " + distance[i]);
		}
	}

	private static int min(int a, int b) {
		if (a < b)
			return a;
		return b;
	}

	private static void dijkstra(int start) {
		// Arrasys.fill は配列の初期化がデキル便利メソッド．ただし1次元配列のみ
		Arrays.fill(distance, INF);
		Arrays.fill(state, 0);
		distance[start] = 0;

		int p = 0; // 確定頂点番号を保存する変数
		for (int step = 0; step < N; step++) {
			int minimum = INF;
			for (int x = 0; x < N; x++) {
				if (state[x] == 0 && distance[x] < minimum) {
					p = x;
					minimum = distance[x];
				}
			}
			if (minimum == INF) {
				System.err.println("Disconnected Graph!\n");
				System.exit(-1);
			}
			state[p] = 1;
			for (int x = 0; x < N; x++)
				distance[x] = min(distance[x], distance[p] + W[p][x]);
		}

	}
}

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

static const int MAX = 100;
static const int INFTY = 1000000000;
static const int WHITE = 0, BLACK = 2;

int n;
int A[MAX][MAX];
int d[MAX], color[MAX];

void sssp() {
	for (int i = 0; i < n; i++) {
		d[i] = INFTY;
		color[i] = WHITE;
	}

	d[0] = 0;

	while (1) {
		int minv = INFTY, u = -1;
		for (int i = 0; i < n; i++) { 
			if (d[i] < minv && color[i] != BLACK) {
				minv  = d[i];
				u = i;
			}
		}
		if (u == -1) break;
		color[u] = BLACK;

		for (int j = 0; j < n; j++) { 
			if (A[u][j] < INFTY && color[j] != BLACK) {
				d[j] = min(d[j], d[u] + A[u][j]);
			}
		}
	}
}

int main() {
	cin >> n;
	for (int i = 0; i < n; i++)	{
		for (int j = 0; j < n; j++) {
			A[i][j] = INFTY;
		}
	}
	
	for (int i = 0; i < n; i++) {
		int u, k, v;
		cin >> u >> k;
		for (int j = 0; j < k; j++) {
			int t;
			cin >> v >> t;
			A[u][v] = t;
		}
	}

	sssp();

	for (int i = 0; i < n; i++) {
		cout << i << ' ' << d[i] << endl;
	}

	return 0;
}