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++: #include<stdio.h>
#include<algorithm>
#include<queue>

using namespace std;

// 0-origin
#define MAX 10000
#define INF 500001
#define WHITE 0
#define GRAY 1
#define BLACK 2

int n;
int M[MAX][MAX]; // 隣接行列
vector< pair<int, int> > adj[MAX]; // 重み付き有向グラフの隣接リスト

// O(|V|^2)
void dijkstra(int start){
    int i, u, v;
    int d[MAX]; // 最短経路のコスト
    int p[MAX]; // 最短経路木における親
    int color[MAX]; // S : GRAY  uに隣接かu自身 : BLACK  S-V : WHITE
    
    //init
    for (i = 0; i < n; i++) {
        d[i] = INF;
        color[i] = WHITE;
    }
    d[start] = 0;
    p[start] = -1;
    
    int mincost;
    while (1) {
        mincost = INF;
        for (i = 0; i < n; i++) {
            if (color[i] != BLACK && d[i] < mincost) {
                mincost = d[i];
                u = i;
            }
        }
        
        if (mincost == INF) {
            break;
        }
        
        color[u] = BLACK;
        /*printf("u:%d\n",u);
        for (i = 0; i < n; i++) {
            printf("%d:%s\n", i, color[i] == 1 ? "WHITE" : color[i] == 0 ? "GRAY" : "BLACK");
        }
         printf("\n");*/
        
        // BLACKのノードから隣接してるノードの最短距離を更新しGRAYにする
        for (v = 0; v < n; v++) {
            if (color[v] != BLACK && M[u][v] != INF) {
                if (d[u] + M[u][v] < d[v]) {
                    d[v] = d[u] + M[u][v];
                    p[v] = u;
                    color[v] = GRAY;
                }
            }
        }
        /*for (i = 0; i < n; i++) {
            printf("%d:%s\n", i, color[i] == WHITE ? "WHITE" : color[i] == GRAY ? "GRAY" : "BLACK");
        }*/
    }
    
    for (i = 0; i < n; i++) {
        printf("%d %d\n", i, d[i]);
    }
}



// O((|V|+|E|)log|V|)
void dijkstra2(int start){
    priority_queue< pair<int, int> > PQ; // pair.firstの値が大きい順に先頭から並ぶ？ first->d, second->ノード番号
    int i,j;
    int color[MAX];
    int d[MAX]; // 最短経路のコスト
    
    // init
    for (i = 0; i < n; i++) {
        d[i] = INF;
        color[i] = WHITE;
    }
    d[start] = 0;
    PQ.push(make_pair(d[start], start));
    color[start] = GRAY;
    
    pair<int, int> f;
    int u;
    while (!PQ.empty()) {
        f = PQ.top();
        PQ.pop();
        u = f.second;
        color[u] = BLACK;
        
        if ( d[u] < f.first*(-1) ) {
            continue;
        }
        
        for (j = 0; j < adj[u].size(); j++) {
            int v = adj[u][j].first; // uとつながっているノードの番号
            if (color[v] == BLACK) {
                continue;
            }
            if (d[u] + adj[u][j].second < d[v]) {
                d[v] = d[u] + adj[u][j].second;
                PQ.push(make_pair(d[v] * (-1), v));
                color[v] = GRAY;
            }
        }
    }
    
    for (int i = 0; i < n; i++) {
        printf("%d %d\n", i, d[i]);
    }
    
}



int main(){
    int i,j,m,l,k;
    
    scanf("%d", &n);
#ifdef d1
    // MをすべてINFに初期化
    for (i = 0; i < n; i++) {
        for (j = 0; j < n; j++) {
            M[i][j] = INF;
        }
    }
    
    // read
    for (i = 0; i < n; i++) {
        scanf("%d %d", &m, &m);
        for (j = 0; j < m; j++) {
            scanf("%d", &l);
            scanf("%d", &M[i][l]);
        }
    }
    /*
    for (i = 0; i < n; i++) {
        for (j = 0; j < n; j++) {
            printf("%d ", M[i][j]);
        }
        printf("\n");
    }*/
    
    dijkstra1(0);
#else
    for (i = 0; i < n; i++) {
        scanf("%d %d", &m, &m);
        for (j = 0; j < m; j++) {
            scanf("%d %d", &l, &k);
            adj[i].push_back(make_pair(l, k));
        }
    }
    
    dijkstra2(0);
#endif
    
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
static const int MAX = 10000;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n;
vector<pair<int, int>> adj[MAX]; // 重み付き有向グラフの隣接リスト表現

void dijkstra(){
    priority_queue<pair<int, int>> PQ;
    int color[MAX];
    int d[MAX];
    for(int i=0; i<n; i++){
        color[i] = WHITE;
        d[i] = INFTY;
    }

    d[0] = 0;
    PQ.push(make_pair(0, 0));
    color[0] = GRAY;

    while(!PQ.empty()){
        pair<int, int> f = PQ.top(); PQ.pop();
        int u = f.second;
        color[u] = BLACK;

        // 最小値を取り出し、それが最短でなければ無視
        if(d[u] < f.first * (-1)) continue;

        for(int j=0; j<adj[u].size(); j++){
            int v = adj[u][j].first;
            if(color[v] == BLACK) continue;
            if(d[v] > d[u] + adj[u][j].second){
                d[v] = d[u] + adj[u][j].second;

                // priority_queueはデフォルトで大きい値を優先するため-1を掛ける
                PQ.push(make_pair(d[v]*(-1), v));
                color[v] = GRAY;
            }
        }
    }

    for(int i=0; i<n; i++){
        cout << i << " " << (d[i] == INFTY ? -1 : d[i]) << endl;
    }
}


int main(){
    int k, u, v, c;

    cin >> n;
    for(int i=0; i<n; i++){
        cin >> u >> k;
        for(int j=0; j<k;j++){
            cin >> v >> c;
            adj[u].push_back(make_pair(v,c));
        }
    }

    dijkstra();

    return 0;
}