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) 
#define PI acos(-1)

using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    cin>>n;
    vector<vector<P>> adj(n);
    rep(i, n) {
        int u, k, v, c;
        cin>>u>>k;
        rep(j, k) {
            cin>>v>>c;
            adj[u].push_back(P(c, v));
        }
    }

    priority_queue<P, vector<P>, greater<P>> q;
    vector<int> wmap(n, -1);
    q.push(P(0, 0));
    while (!q.empty()) {
        P p = q.top(); q.pop();
        int w = p.first;
        int v = p.second;
        if (wmap[v] != -1) continue;

        wmap[v] = w;
        for (auto e : adj[v]) {
            q.push(P(e.first + w, e.second));
        }
    }

    rep(i, n) cout<<i<<" "<<wmap[i]<<endl;
}

C++: #include<iostream>
#include<queue>
#include<vector>
using namespace std;
#define MAX 10000
#define Infinit 1e+10
#define White 0
#define Black 1
#define Red 2
int n;
vector<pair<int, int> >Relate[MAX];
struct Node{
	int id;
	int weight;

	Node(int inputted_id, int inputted_weight){
		id = inputted_id;
		weight = inputted_weight;
	}
	bool operator<(const Node& another) const{
		return weight < another.weight;
	};
	//2つのconstを付けないとコンパイルエラーになるので注意!!
};
void search() {
	int color[MAX],d[MAX],pointer;
	priority_queue<Node> path;
	for (int i = 0; i < n; i++) {
		if (i == 0) d[i] = 0;
		else d[i] = Infinit;
		color[i] = White;
	}
	path.push(Node(0, 0));
	while (!path.empty()) {
		Node x = path.top();
		pointer=x.id;
		color[pointer] = Black;
		for (int i = 0; i < Relate[pointer].size(); i++) {
			int v = Relate[pointer][i].first;
			if (d[pointer] + Relate[pointer][i].second < d[v] && color[v] != Black) {
				d[v] = d[pointer] + Relate[pointer][i].second;
				color[v] = Red;
				path.push(Node(v,d[v]*(-1)));

			}
		}
		path.pop();
	}
	for (int i = 0; i < n; i++) {
		cout << i << " " << d[i] << endl;
	}
}
int main() {
	int u, k, v, c;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> u >> k;
		for (int j = 0; j < k; j++) {
			cin >> v >> c;
			Relate[u].push_back(make_pair(v, c));

		}
	}
	search();

}

C++: #include<iostream>
#include<algorithm>
#include<queue>
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;
	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;
}

C++: #include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
static const int MAX = 10000;
static const int MIN = 10000000;
static const int WH = 0;
static const int GR = 1;
static const int BL = 2;

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

void dijkstra(void){
  priority_queue<pair<int,int> > PQ;
  int color[MAX],d[MAX],i,j,v;
  for(i=0;i<n;i++){
    d[i]=MIN;
    color[i]=WH;
  }
  d[0]=0;
  PQ.push(make_pair(0,0));
  color[0]=GR;

  while(!PQ.empty()){
    pair<int,int> f=PQ.top(); PQ.pop();
    int u=f.second;
    color[u]=BL;
    if(d[u]<f.first*(-1))continue;
    for(j=0;j<ad[u].size();j++){
      v=ad[u][j].first;
      if(color[v]==BL) continue;
      if(d[v]>d[u]+ad[u][j].second){
	d[v]=d[u]+ad[u][j].second;
	PQ.push(make_pair(d[v]*(-1),v));
	color[v]=GR;
      }
    }
  }
  for(i=0;i<n;i++) cout<< i << " " << (d[i]==MIN ? -1:d[i]) << endl;
}

int main(void){
  int i,j,m,l,k,c;

  cin>>n;
  for(i=0;i<n;i++){
    cin>> m >> l;
    for(j=0;j<l;j++){
      cin >> k >> c;
      ad[m].push_back(make_pair(k,c));
    }
  }
  dijkstra();
  return 0;
}