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

int cost[100][100];//cost[a][b] a??????b????§?????????????????????????
long long int d[100];//??????s?????????????°??????¢
bool used[100];
int arrow;//????????°

const int INF = 10000000;

void dijkstra(){
  fill(d,d+arrow,INF);
  fill(used,used + arrow,false);
  d[0] = 0;

  while(1){
    int v=-1;
    // ???????????????????????????????????????????????¢???????°???????????????¢???
    for(int u=0;u<arrow;u++){
      if(!used[u] && (v == -1 || d[u] < d[v])) v = u;
    }

    if(v == -1) break;

    used[v] = true;

    for(int u=0; u<arrow; u++){
      if(cost[v][u] != INF){
        d[u] = min(d[u],d[v] + cost[v][u]);
      }
    }
  }

  for(int u=0; u<arrow; u++){
    cout << u << " " << d[u] << endl;
  }

}

int main(){

    cin >> arrow;

    int n,a,v,c;



    for(int i=0;i<arrow;i++){
      for(int j=0;j<arrow;j++){
        cost[i][j] = INF;
      }
    }

    for(int u=0;u<arrow;u++){

      cin >> n >> a;

      for(int i=0; i<a;i++){
        cin >> v >> c;
        cost[n][v] = c;
      }
    }

    dijkstra();

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
typedef pair<int,int> pp;
const int INF = 1001001001;
struct edge{int to, cost;};

int main() {
    int V;
    cin >> V;
    vector< vector<edge> > A(V);
    for(int i=0; i<V; i++) {
        int u,k;
        cin >> u >> k;
        A[u].resize(k);
        for(int j=0; j<k; j++) {
            int v,c;
            cin >> v >> c;
            struct edge e = {v,c};
            A[u][j] = e;
        }
    }

    vector<int> d(V,INF);
    d[0] = 0;
    priority_queue< pp, vector<pp>, greater<pp> > Q;
    Q.push(pp(d[0],0));
    
    while(!(Q.empty())) {
        pp temp = Q.top();
        Q.pop();
        int ct = temp.first;
        int u = temp.second;
        for(int j=0; j<A[u].size(); j++) {
            int v = A[u][j].to;
            int tmpcost = A[u][j].cost;
            if(d[v] > ct + tmpcost) {
                d[v] = ct + tmpcost;
                Q.push(pp(d[v], v));
            }
        }
    }

    for(int i=0; i<V; i++) cout << i << " " << d[i] << endl;
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;

const int INF = numeric_limits<int>::max();

struct Graph {
    struct edge {
        int v, c;
    };
    vector<vector<edge>> adj;
    vector<int> d;
    Graph(int n) {
        adj.assign(n, vector<edge>());
        d.assign(n, INF);
    }
};

int main()
{
    int n;
    cin >> n;
    Graph g(n);
    for (int i = 0; i < n; i++) {
        int u, k;
        cin >> u >> k;
        for (int j = 0; j < k; j++) {
            int v, c;
            cin >> v >> c;
            g.adj[i].push_back({v, c});
        }
    }

    priority_queue<P, vector<P>, greater<P>> pq;
    g.d[0] = 0;
    pq.push(P(0, 0));
    while (!pq.empty()) {
        int c = pq.top().first;
        int u = pq.top().second;
        pq.pop();
        if (g.d[u] < c) continue;
        for (auto e : g.adj[u]) {
            if (g.d[e.v] > g.d[u] + e.c) {
                g.d[e.v] = g.d[u] + e.c;
                pq.push(P(g.d[e.v], e.v));
            }
        }
    }

    for (int i = 0; i < n; i++) {
        cout << i << " " << g.d[i] << endl;
    }
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
static const int R =10000;
static const int IF = (1<<20);
static const int WH = 0;
static const int GR =1;
static const int BL =2;

int num;
vector<pair<int,int> > ax[R];

void dx(){
  priority_queue<pair<int,int> > Pi;
  int IR[R],i,j,y,x;
  int D[R];

  for(i=0;i<num;i++){
    D[i] = IF;
    IR[i] = WH;
  }

  D[0] = 0;
  Pi.push(make_pair(0,0));
  IR[0] =GR;

  while(!Pi.empty()){
    pair<int,int> F=Pi.top();
    Pi.pop();
    x =F.second;

    IR[x] =BL;

    if(D[x] < F.first * (-1)){
      continue;
    }

    for(j=0;j<ax[x].size();j++){
       y= ax[x][j].first;
       
      if(IR[y] ==BL){
	continue;
      }
      if(D[y] > D[x] + ax[x][j].second){
	 D[y] = D[x] + ax[x][j].second;
	 Pi.push(make_pair(D[y] * (-1),y));
	 IR[y] = GR;
	 }
    }
  }

  for(int i=0;i<num;i++){
    cout << i << " " << (D[i] == IF ? -1 : D[i] ) << endl;
  }
}

int main(){
  int z,x,y,ci,i,j;

  cin >> num;
  for(i=0;i<num;i++){
    cin >> x >> z;

    for(j=0;j<z;j++){
      cin >> y >> ci;
      ax[x].push_back(make_pair(y,ci));
    }
  }
  dx();

  return 0;
}