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=100000;
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<iostream>
using namespace std;

const int INF = 1 << 30;
int cnt = 0;

class Vertex{
public:
    int i;
    int d;
};

void createList(int n, Vertex *list, int *record);
void push(Vertex *q, Vertex vertex);
Vertex pop(Vertex *q);
void buildMinHeap(Vertex *a, int i);
void minHeapify(Vertex *a, int i);
void displayAnswer(int *a, int n);

int main() {

    int n;
    cin>>n;
    
    Vertex list[501000];
    int record[10001];
    createList(n, list, record);
    
    //printf("-----");

    Vertex priorityQueue[501000];
    for(int i = record[0]; i < record[1]; i++) {
        push(priorityQueue, list[i]);
    }

    int answer[10001];
    for (int i = 0; i <= 10001; i++) {
        answer[i] = INF;
    }
    
    for (int i = 0; i < n-1;) {
        Vertex min = pop(priorityQueue);
        
        if(answer[ min.i ] == INF) {
            answer[ min.i ] = min.d;
            for(int j = record[min.i]; j < record[min.i+1]; j++) {
                if(list[j].i == 0) continue;
                list[j].d += min.d;
                push(priorityQueue, list[j]);
            }
            i++;
        }
    }
    
    displayAnswer(answer, n);
    return 0;
}

void createList(int n, Vertex *list, int *record) {
    int sumRecord = 0;
    for(int i = 0; i < n; i++) {
        int u, k;
        cin>>u>>k;
        record[i] = sumRecord;
        sumRecord += k;
        for(int j = record[i]; j < sumRecord; j++) {
            int c, v;
            cin>>c>>v;
            list[j].i = c;
            list[j].d = v;
        }
    }
    record[n] = sumRecord;
}

void push(Vertex *q, Vertex vertex) {
    cnt++;
    q[cnt] = vertex;
    buildMinHeap(q, cnt);
}

Vertex pop(Vertex *q) {
    Vertex min = q[1];
    q[1] = q[cnt];
    cnt--;
    minHeapify(q, 1);
    return min;
}

void buildMinHeap(Vertex *list, int i) {
    if (i >= 1 && list[i].d < list[i/2].d) {
        Vertex tmp = list[i];
        list[i] = list[i/2];
        list[i/2] = tmp;
        buildMinHeap(list, i/2);
    }
}

void minHeapify(Vertex *list, int i) {
  int l = i*2;
  int r = i*2+1;

  int smallest = i;
  if(l <= cnt && list[l].d < list[smallest].d )  smallest = l;
  if(r <= cnt && list[r].d < list[smallest].d ) smallest = r;

  if(smallest != i) {
    Vertex tmp = list[i];
    list[i] = list[smallest];
    list[smallest] = tmp;
    minHeapify(list, smallest);
  }
}

void displayAnswer(int *a, int n) {
    cout<<0<<' '<<0<<endl;
    for(int i = 1; i < n; i++) {
        cout<<i<<' '<<a[i]<<endl;
    }
}