Go: package main

import (
	"fmt"
	"bufio"
	"os"
	"strconv"
	"container/heap"
)

type Node struct {
	Id int
	Dis int
}

type PriorityQueue []*Node

func (pq PriorityQueue) Len() int { return len(pq) }

func (pq PriorityQueue) Less(i, j int) bool {
	return pq[i].Dis < pq[j].Dis
}

func (pq PriorityQueue) Swap(i, j int) {
	pq[i], pq[j] = pq[j], pq[i]
}

func (pq *PriorityQueue) Push(x interface{}) {
	*pq = append(*pq, x.(*Node))
}

func (pq *PriorityQueue) Pop() interface{} {
	n := len(*pq)
	pop := (*pq)[n-1]
	*pq = (*pq)[0:n-1]
	return pop
}

func main() {
	var n int
	fmt.Scan(&n)

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

	g := make([][]int, n)
	c := make([][]int, n)
	pq := make(PriorityQueue, 0, n)
	d := make([]int, n)
	for i := 0; i < n; i++ {
		sc.Scan()
		u, _ := strconv.Atoi(sc.Text())
		sc.Scan()
		k, _ := strconv.Atoi(sc.Text())
		g[u] = make([]int, k)
		c[u] = make([]int, k)
		for j := 0; j < k; j++ {
			sc.Scan()
			g[u][j], _ = strconv.Atoi(sc.Text())
			sc.Scan()
			c[u][j], _ = strconv.Atoi(sc.Text())
		}

		if u == 0 {
			d[u] = 0
		} else {
			d[u] = 1 << 30
		}
		pq.Push(&Node{u, d[u]})
	}
	heap.Init(&pq)

	for pq.Len() > 0 {
		node := heap.Pop(&pq).(*Node)
		for i := 0; i < len(g[node.Id]); i++ {
			nextId := g[node.Id][i]
			nextDis := node.Dis + c[node.Id][i]
			if nextDis < d[nextId] {
				d[nextId] = nextDis
				heap.Push(&pq, &Node{nextId, nextDis})
			}
		}
	}

	wr := bufio.NewWriter(os.Stdout)
	for i := 0; i < n; i++ {
		wr.WriteString(strconv.Itoa(i))
		wr.WriteString(" ")
		wr.WriteString(strconv.Itoa(d[i]))
		wr.WriteString("\n")
	}
	wr.Flush()
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define REPR(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
const int INF = 1001001001;
typedef pair<int,int> pii;

template<class t> inline bool chmax(t& a, t b) { if (a < b) { a = b; return 1; } return 0; }
template<class t> inline bool chmin(t& a, t b) { if (a > b) { a = b; return 1; } return 0; }

using Graph = vector<vector<pii> >;

int n;
vector<bool> seen;
vector<int> dist;
priority_queue<pair<int, int> > pq;

void dijkstra(const Graph &G, int v){
  seen[v] = true;

  for(pii p : G[v]){
    int u = p.first;
    int c = p.second;
    if(seen[u] == true) continue;
    if(chmin(dist[u], dist[v]+c)) pq.push(make_pair((-1)*dist[u], u));
  }

  while(!pq.empty()){
    pair<int, int> tmp;
    tmp = pq.top();
    pq.pop();
    if(seen[tmp.second]) continue;
    int nv = tmp.second;
    dijkstra(G, nv);
  }

  return;
}

int main(){
  cin >> n;

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

  seen.assign(n, false);
  dist.assign(n, INF);
  dist[0] = 0;
  dijkstra(G, 0);

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

  return 0;
}

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;
}