Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

const BIG_COST = 200000

type Path struct {
	node int
	cost int
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	nNodes := scanInt(sc)

	// 各頂点につながる頂点一覧を得るための隣接リスト
	graph := make([][]Path, nNodes)

	for i := 0; i < nNodes; i++ {
		u := scanInt(sc)
		k := scanInt(sc)
		graph[i] = make([]Path, k)
		for d := 0; d < k; d++ {
			graph[u][d] = Path{
				node: scanInt(sc),
				cost: scanInt(sc),
			}
		}
	}

	// 0 から各頂点への最小コストを保存する配列
	minCosts := make([]int, nNodes)

	minCosts[0] = 0
	for i := 1; i < nNodes; i++ {
		minCosts[i] = BIG_COST
	}

	// 各頂点が調査済みかどうかを保持する配列
	checked := make([]bool, nNodes)

	// 最小コストのパスを高速に取得するためのヒープ。
	// コストが小さいものほどルートに来るようにする。
	heap := NewHeap(func(a, b Path) bool {
		return a.cost < b.cost
	})

	heap.insert(Path{node: 0, cost: 0})
	for heap.size > 0 {
		u := heap.extractMax()

		// 隣接行列を使っていた時とは違い、ヒープには
		// 同じノードへのパスが複数含まれうる。そのため既によりコストの低い
		// パスが見つかっている場合は無視する。
		if minCosts[u.node] < u.cost {
			continue
		}

		checked[u.node] = true

		for _, v := range graph[u.node] {
			cost := v.cost + u.cost
			if !checked[v.node] && cost < minCosts[v.node] {
				minCosts[v.node] = cost
				heap.insert(Path{node: v.node, cost: cost})
			}
		}
	}

	w := bufio.NewWriter(os.Stdout)
	for i, cost := range minCosts {
		fmt.Fprintf(w, "%d %d\n", i, cost)
	}
	w.Flush()
}

func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	v, _ := strconv.Atoi(sc.Text())
	return v
}

// --- From ALDS1_9_C: Priority Queue

type Heap struct {
	size   int
	heap   []Path
	isHigh func(a, b Path) bool
}

func NewHeap(isHigh func(a, b Path) bool) Heap {
	heap := make([]Path, 1) // 先頭は不使用
	return Heap{size: 0, heap: heap, isHigh: isHigh}
}

func (h *Heap) insert(v Path) {
	h.size += 1
	if h.size > len(h.heap)-1 {
		h.heap = append(h.heap, v)
	} else {
		h.heap[h.size] = v
	}

	for i := h.size; i > 1; {
		parent := i / 2
		if h.isHigh(h.heap[parent], h.heap[i]) {
			break
		}
		h.heap[i], h.heap[parent] = h.heap[parent], h.heap[i]
		i = parent
	}
}

func (h *Heap) extractMax() Path {
	if h.size <= 0 {
		panic("cannot extract from empty heap")
	}

	max := h.heap[1]
	h.heap[1] = h.heap[h.size]
	h.size -= 1
	h.maxHeapify(1)

	return max
}

func (h *Heap) maxHeapify(idx int) {
	left := idx * 2
	right := left + 1
	largest := idx

	if left <= h.size {
		if h.isHigh(h.heap[left], h.heap[idx]) {
			largest = left
		}
		if right <= h.size && h.isHigh(h.heap[right], h.heap[largest]) {
			largest = right
		}
	}

	if largest != idx {
		h.heap[idx], h.heap[largest] = h.heap[largest], h.heap[idx]
		h.maxHeapify(largest)
	}
}

C++: #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)

using namespace std;
using ll = long long;
using v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;

static const int MAX = 100000;
static const int BLACK = -1;
static const int WHITE = 0;
static const int GLAY = 1;
static const int INFTY = 1e9;

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

void pdai(){
	priority_queue<pair<int, int>> PQ;
	int d[MAX];
	int color[MAX];
	rep(i, n){
		d[i] = INFTY;
		color[i] = WHITE;
	}
	PQ.push(make_pair(0, 0));
	color[0] = GLAY;
	d[0] = 0;
	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 i = 0; i < adj[u].size(); i++){
			int v = adj[u][i].first;
			if(color[v] != BLACK && d[v] > d[u] + adj[u][i].second){
				d[v] = d[u] + adj[u][i].second;
				PQ.push(make_pair(d[v]*(-1), v));
				color[v] = GLAY;
			}
		}
	}
	rep(i, n){
		if(d[i] == INFTY) d[i] = -1;
		cout << i << " " << d[i] << endl;
	}
}

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

C++: #include <iostream>
#include <vector>
#include <queue>
#define INF 1e9
using namespace std;

int main(){
    //declaration and input
    int n;
    cin >> n;
    int u, k;
    vector<vector<pair<int, int>>> graph(n);
    for (int i = 0; i < n; i++){
        cin >> u >> k;
        int v, c;
        for (int j = 0; j < k; j++){
            cin >> v >> c;
            graph[u].push_back(make_pair(c, v));
        }
    }
    vector<int> cost(n, INF);
    vector<bool> is_visit(n, false);
    vector<int> parent_of(n, -1);

    //dijkstra
    //init
    cost[0] = 0;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> que;
    que.push(make_pair(0, 0));

    //loop
    while (!que.empty()){
        pair<int, int> p = que.top();
        que.pop();
        int c = p.first; //cost
        int v = p.second; //vertax
        is_visit[v] = true;
        if (c > cost[v])
            continue;
        for (int i = 0; i < graph[v].size(); i++){
            if (!is_visit[graph[v][i].second]){
                if (cost[v] + graph[v][i].first < cost[graph[v][i].second]){
                    cost[graph[v][i].second] = cost[v] + graph[v][i].first;
                    que.push(make_pair(cost[graph[v][i].second], graph[v][i].second));
                    parent_of[graph[v][i].second] = v;
                }
            }
        }
    }

    //output
    for (int i = 0; i < n; i++){
        cout << i << ' ' << cost[i] << endl;
    }
    return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<stack>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#define _USE_MATH_DEFINES // M_PI????????????????????????
#include<math.h>
#include<queue>
#pragma warning(disable:4996)
using namespace std;

static const int MAX = 10000;
static const int INFTY = (1<<20);
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++){
		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;
				// 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] ) << "\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<n; j++){
			cin >> v >> c;
			adj[u].push_back(make_pair(v,c));
		}
	}
	dijkstra();
	return 0;
}