Go: package main

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

const NIL = -1

type Node struct {
	id     int
	weight int
}

func init() {
	sc.Split(bufio.ScanWords)
}

type NodeHeap []Node

func (h NodeHeap) Len() int           { return len(h) }
func (h NodeHeap) Less(i, j int) bool { return h[i].weight < h[j].weight }
func (h NodeHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *NodeHeap) Push(x interface{}) {
	*h = append(*h, x.(Node))
}

func (h *NodeHeap) Pop() interface{} {
	old := *h
	n := len(old)
	x := old[n-1]
	*h = old[0 : n-1]
	return x
}

var sc = bufio.NewScanner(os.Stdin)

func scanInt() int {
	num, _ := strconv.Atoi(scanString())
	return num
}

func scanString() string {
	sc.Scan()
	return sc.Text()
}

func init() {
	sc.Split(bufio.ScanWords)
}

func main() {
	n := scanInt()

	route := make([][]Node, n)
	weight := make([]int, n)
	for i := 0; i < n; i++ {
		weight[i] = NIL
	}

	for i := 0; i < n; i++ {
		u := scanInt()
		k := scanInt()
		route[i] = make([]Node, k)
		for j := 0; j < k; j++ {
			route[u][j] = Node{id: scanInt(), weight: scanInt()}
		}
	}

	start := Node{id: 0, weight: 0}
	h := &NodeHeap{start}
	heap.Init(h)

	for h.Len() > 0 {
		node := heap.Pop(h).(Node)
		if weight[node.id] != NIL {
			continue
		}
		weight[node.id] = node.weight

		for _, nextNode := range route[node.id] {
			if weight[nextNode.id] != NIL {
				continue
			}
			nextNode.weight += node.weight
			heap.Push(h, nextNode)
		}
	}

	for i, w := range weight {
		fmt.Println(i, w)
	}
}

C++: #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;



#define SIZE 100005

struct Edge{
	Edge(int arg_to,int arg_dist){
		to = arg_to;
		dist = arg_dist;
	}
	int to,dist;
};

struct Info{
	Info(int arg_node_id,int arg_sum_dist){
		node_id = arg_node_id;
		sum_dist = arg_sum_dist;
	}
	bool operator<(const struct Info &arg) const{

		return sum_dist > arg.sum_dist; //総距離の昇順(PQ)
	}

	int node_id,sum_dist;
};

int V;
int min_dist[SIZE];
vector<Edge> G[SIZE];

int main(){

	scanf("%d",&V);

	int node_id,num_node,to,dist;

	for(int i = 0; i < V; i++){

		scanf("%d %d",&node_id,&num_node);
		for(int k = 0; k < num_node; k++){

			scanf("%d %d",&to,&dist);
			G[node_id].push_back(Edge(to,dist));
		}
	}

	for(int i = 0; i < V; i++){

		min_dist[i] = BIG_NUM;
	}

	priority_queue<Info> Q;
	min_dist[0] = 0;

	Q.push(Info(0,0));

	while(!Q.empty()){

		if(Q.top().sum_dist > min_dist[Q.top().node_id]){

			Q.pop();

		}else{

			for(int i = 0; i < G[Q.top().node_id].size(); i++){

				int next_node = G[Q.top().node_id][i].to;
				int next_dist = Q.top().sum_dist+G[Q.top().node_id][i].dist;

				if(min_dist[next_node] > next_dist){
					min_dist[next_node] = next_dist;
					Q.push(Info(next_node,next_dist));
				}
			}
			Q.pop();
		}
	}

	for(int i = 0; i < V; i++){

		printf("%d %d\n",i,min_dist[i]);
	}

	return 0;
}

C++: //dijkstra算法
#include <iostream>
#include <vector>
#include <queue>

using namespace std;

//INFTY要足够大
const int INFTY = 1 << 21;

const int N = 10000;

vector<pair<int,int> >Graph[N];

int n;

void dijkstra(int u0) {
	int *d = new int[n];
	char *color = new char[n];
	for (int i=0; i<n; i++) {
		d[i] = INFTY;
		color[i] = 'W';
	}

	d[u0] = 0;
	color[u0] = 'G';
	priority_queue<pair<int,int> > PQ;
	PQ.push(make_pair(0,u0));

	while (!PQ.empty()) {
		pair<int,int> f = PQ.top();
		PQ.pop();
		int u = f.second;

		color[u] = 'B';

		//if (d[u] < f.first * -1) continue;

		for (int i=0; i<Graph[u].size(); i++) {
			pair<int,int> p = Graph[u][i];
			int v = p.first;
			if (color[v] != 'B'&& d[v] > d[u] + p.second) {
				d[v] = d[u] +p.second;
				color[v] = 'G';
				PQ.push(make_pair(d[v] * -1,v));
			}
		}
	}
	for (int i=0; i<n; i++) {
		cout << i << " " << (d[i] == INFTY ? -1 : d[i]) << endl;
	}
}

int main() {

	cin >> 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;
			Graph[u].push_back(make_pair(v,c));
		}
	}
	dijkstra(0);
	return 0;
}

C++: //
//  main.cpp
//
//
//  Created by ???????????? on 2017/10/23.
//  Copyright ?? 2017 ????????????. All rights reserved.
//

#include <iostream>
#include <stdio.h>
#include <queue>
#include <algorithm>


#define n_max 10000
#define WHITE 0
#define GRAY 1
#define BLACK 2
#define INFTY 1<<20

using namespace std;

int n, color[n_max], d[n_max], p[n_max];

vector<pair<int, int> > adj[n_max];


void init(){
    int i, j, id, num, node, weight;
    scanf("%d", &n);
    
    for(i = 0; i < n; i++){
        scanf("%d %d", &id, &num);
        for(j = 0; j < num; j++){
            scanf("%d", &node);
            scanf("%d", &weight);
            adj[id].push_back(make_pair(node, weight));
        }
        color[i] = WHITE;
        d[i] = INFTY;
    }
}

void dijkstra(){
    //initializing
    d[0] = 0;
    p[0] = -1;
    
    priority_queue<pair<int,int> > PQ;
    
    PQ.push(make_pair(0, 0));
    
    int u;
    while(!PQ.empty()){
        //first weight, second idx
        pair<int, int> f= PQ.top(); PQ.pop();
        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){
                if((d[u] + adj[u][j].second) < d[v]){
                    d[v] = adj[u][j].second + d[u];
                    PQ.push(make_pair(d[v]*(-1), v));
                    color[v] = GRAY;
                }
            }
        }
    }
    for(int i = 0; i < n; i++){
        cout<<i<<" "<<d[i]<<endl;
    }
}

int main(int argc, const char * argv[]) {
    init();
    dijkstra();
    return 0;
}

C++: #include<stdio.h>
#include<queue>
#include<string.h>
using namespace std;
#define INF 1 << 30
struct ss{
	int next;
	int to;
	int val;
}e[200050];
int head[200050];
int tot;
void add(int x,int y,int val){
	e[tot].next=head[x];
	e[tot].to=y;
	e[tot].val=val;
	head[x]=tot++;
}
int n;
int vis[200000];
int dis[200050];
void spfa(){
	for(int i=0;i<n;i++){
		dis[i]=INF;
	}
	vis[0]=1;
	dis[0]=0;
	queue<int> st;
	st.push(0);
	while(!st.empty()){
		int t=st.front();
		st.pop();
		vis[t]=0;
		for(int i=head[t];i!=-1;i=e[i].next){
			int to=e[i].to;
			if(dis[to]>dis[t]+e[i].val){
				dis[to]=dis[t]+e[i].val;
				if(!vis[to]){
					st.push(to);
					vis[to]=1;
				}
			}
		}
	}
}
int main(){
	scanf("%d",&n);
	tot=0;
	memset(head,-1,sizeof(head));
	int a,to,val,num;
	for(int i=0;i<n;i++){
		scanf("%d %d",&a,&num);
		for(int j=1;j<=num;j++){
			scanf("%d %d",&to,&val);
			add(a,to,val);
		}
	}
	spfa();
	printf("0 0\n");
	for(int i=1;i<n;i++){
		printf("%d %d\n",i,dis[i]);
	}
	return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
#define Lens 10005
#define Inf 1<<22

using namespace std;
vector<pair<int, int> > adj[Lens];
int N;
char c[Lens];
int d[Lens];

void dijkstra()
{
	d[0] = 0;
	priority_queue<pair<int, int> > PQ;
	PQ.push(make_pair(0, 0));
	while (!PQ.empty())
	{
		pair<int, int> t = PQ.top();
		PQ.pop();
		int u = t.second;
		c[u] = 'b';
		if (d[u] < -t.first) continue;
		for (int i = 0; i < adj[u].size(); i++)
		{
			int tmp = adj[u][i].first;
			if (c[tmp] == 'w'&&d[tmp] > d[u] + adj[u][i].second)
			{
				d[tmp] = d[u] + adj[u][i].second;
				PQ.push(make_pair(-d[tmp],tmp));
				cout << tmp << "  " << d[tmp] << endl;
			}
		}

	}
}

int main()
{

	cin >> N;
	for (int i = 0; i < N; i++)
	{
		int k, n;
		cin >> k >> n;
		c[k] = 'w';
		d[k] = Inf;
		for (int j = 0; j < n; j++)
		{
			int v, tw;
			cin >> v >> tw;
			adj[k].push_back(make_pair(v, tw));
		}

	}
	dijkstra();
	for (int i = 0; i < N; i++)
	{
		cout << i << ' ' << d[i] << endl;;
	}
	return 0;
}