Go: package main

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

// I/O
type Scanner struct {
	sc *bufio.Scanner
}

func NewScanner() *Scanner {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024), int(1e+9))
	return &Scanner{sc}
}

func (s *Scanner) nextStr() string {
	s.sc.Scan()
	return s.sc.Text()
}

func (s *Scanner) nextInt() int {
	i, e := strconv.Atoi(s.nextStr())
	if e != nil {
		panic(e)
	}
	return i
}

func (s *Scanner) nextFloat() float64 {
	f, e := strconv.ParseFloat(s.nextStr(), 64)
	if e != nil {
		panic(e)
	}
	return f
}

func (s *Scanner) nextRuneSlice() []rune {
	return []rune(s.nextStr())
}

func (s *Scanner) nextIntSlice(n int) []int {
	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextInt()
	}
	return res
}

func (s *Scanner) nextFloatSlice(n int) []float64 {
	res := make([]float64, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextFloat()
	}
	return res
}

// Arithmetic
func max(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m < i {
			m = i
		}
	}
	return m
}

func min(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m > i {
			m = i
		}
	}
	return m
}

func abs(x int) int {
	if x > 0 {
		return x
	}
	return -x
}

func pow(x, y int) int {
	res := 1
	for i := 0; i < y; i++ {
		res *= x
	}
	return res
}

func ceil(a, b int) int {
	if a%b == 0 {
		return a / b
	} else {
		return a/b + 1
	}
}

// Sort
type RuneSlice []rune

func (a RuneSlice) Len() int           { return len(a) }
func (a RuneSlice) Less(i, j int) bool { return a[i] < a[j] }
func (a RuneSlice) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }

// Main
const INF = 1 << 60

type Edge struct {
	to, cost int
}

type Node struct {
	id, cost int
}

type PQ []Node

func (pq PQ) Len() int           { return len(pq) }
func (pq PQ) Less(i, j int) bool { return pq[i].cost < pq[j].cost }
func (pq PQ) Swap(i, j int)      { pq[i], pq[j] = pq[j], pq[i] }

func (pq *PQ) Push(x interface{}) {
	*pq = append(*pq, x.(Node))
}

func (pq *PQ) Pop() interface{} {
	old := *pq
	n := len(old)
	x := old[n-1]
	*pq = old[0 : n-1]
	return x
}

func main() {
	sc := NewScanner()
	wtr := bufio.NewWriter(os.Stdout)
	N := sc.nextInt()
	E := make([][]Edge, N)
	for i := 0; i < N; i++ {
		id, k := sc.nextInt(), sc.nextInt()
		E[id] = make([]Edge, k)
		for j := 0; j < k; j++ {
			to, cost := sc.nextInt(), sc.nextInt()
			E[id][j] = Edge{to, cost}
		}
	}

	d := make([]int, N)
	for i := 0; i < N; i++ {
		d[i] = INF
	}
	done := make([]bool, N)
	pq := &PQ{}
	heap.Init(pq)
	d[0] = 0
	heap.Push(pq, Node{0, 0})
	for pq.Len() > 0 {
		cur := heap.Pop(pq).(Node).id
		if done[cur] {
			continue
		}
		done[cur] = true
		for i := 0; i < len(E[cur]); i++ {
			to, cost := E[cur][i].to, E[cur][i].cost+d[cur]
			if !done[to] && cost < d[to] {
				d[to] = cost
				heap.Push(pq, Node{to, cost})
			}
		}
	}

	for i := 0; i < N; i++ {
		fmt.Fprintln(wtr, i, d[i])
	}
	wtr.Flush()
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
static const int MAX=100;
static const int INFTY=2000000000;
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 d[MAX],color[MAX];
    for(int i=0;i<n;i++){
        d[i]=INFTY;
        color[i]=WHITE;
    }
    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;
                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])<<"\n";
}
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;
}

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;
}