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 <vector>
#include <queue>
using namespace std;
static const int MAX = 10000;
int N;
vector<pair<int, int>> adj[MAX];
int color[MAX];
int d[MAX];
int INF = 1 << 30;

void pd() {
    for (int i = 0; i < N; i++) {
        cout << d[i] << " ";
    }
    cout << endl;
}

void pa() {
    for (int i = 0; i < N; i++) {
        cout << i << " ";
        for (int j = 0; j < adj[i].size(); j++) {
            cout << adj[i][j].second << " ";
        }
        cout << endl;
    }
    cout << endl;
}

void dijkstr() {
    int i,j;
    priority_queue<pair<int, int>> PQ;
    PQ.push(make_pair(0, 0));
    
    d[0] = 0;
    cout << N << endl;
    for (i = 0; i < N; i++) {
        pair<int, int> p = PQ.top(); PQ.pop();
        
        //int c = p.first;
        int id = p.second;
        
        color[id] = 1;
        for (j = 0; j < adj[id].size(); j++) {
            auto node = adj[id][j];
            int c = node.first;
            int k = node.second;
            if (color[k] != 1) {
                if (d[k] > d[id] + c) {
                    d[k] = d[id] + c;
                    PQ.push(make_pair(-c, k));
                }
            }
        }
    }
}



int main(int argc, const char * argv[]) {
    int i,j;
    cin >> N;
//    pd();

    for (i = 0; i < N; i++) {
        int u,k;
        cin >> u >> k;
        color[i] = 0;
        d[i] = INF;
        for (j = 0; j < k; j++) {
            int v, c;
            cin >> v >> c;
            adj[u].push_back(make_pair(c, v));
        }
    }
    
    //pa();
    
    dijkstr();
    
    for (i = 0; i < N; i++) {
        cout << i << " " << d[i] << endl;
    }
    
    
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

const int MAX=10005;
int state[MAX],N,D[MAX];
vector<pair<int,int>> S[MAX];
priority_queue<pair<int,int>> Q;

void dijkstra(){
    int cnt=1;
    for(int i=0;i<N;i++){
        state[i]=0;
        D[i]=100000000;
    }
    state[0]=1;
    D[0]=0;
    for(int i=0;i<S[0].size();i++){
        Q.push(make_pair(-S[0][i].second,S[0][i].first));
        D[S[0][i].first]=min(D[S[0][i].first],D[0]+S[0][i].second);
    }
    while(1){
        int a=Q.top().second;
            if(state[a]==0){
            Q.pop();
            state[a]=1;
            cnt++;
            for(int i=0;i<S[a].size();i++){
                if(state[S[a][i].first]==0){
                    Q.push(make_pair(-S[a][i].second,S[a][i].first));
                    D[S[a][i].first]=min(D[S[a][i].first],D[a]+S[a][i].second);
                }
            }
        }
        else Q.pop();
        if(cnt==N) break;
    }
    return;
}


int main(){
   
    cin>>N;
    for(int i=0;i<N;i++){
        int l,a;cin>>l>>a;
        for(int j=0;j<a;j++){
            int b,c;cin>>b>>c;
            S[i].push_back(make_pair(b,c));
        }
    }
    dijkstra();
    for(int i=0;i<N;i++){
        cout<<i<<" "<<D[i]<<endl;
    }
}

C++: #include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
#define MAX 10000
#define INFTY (1<<30)
#define rep(i,n)	for(int i=0;i<n;i++)
enum{
	white,
	gray,
	black,
};

int n;
vector<pair<int,int> >	adj[MAX];

void dijkstra(){
	priority_queue<pair<int,int> >	pq;
	int color[MAX];
	int d[MAX];
	rep(i,n){
		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;
		rep(j,(int)adj[u].size()){
			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;
			}
		}
	}
	rep(i,n){
		cout<<i<<" "<<(d[i]==INFTY?-1:d[i])<<endl;
	}
}

int main(){
	int k,u,v,c;
	cin>>n;
	rep(i,n){
		cin>>u>>k;
		rep(j,k){
			cin>>v>>c;
			adj[u].push_back(make_pair(v,c));
		}
	}
	dijkstra();
	return 0;
}