Go: // ダイクストラのアルゴリズム
package main

import (
	"bufio"
	"fmt"
	"log"
	"math"
	"os"
	"strconv"
	"strings"
)

type color int

const (
	white color = iota // 未訪問
	mst                // MSTとして確定
)

// 頂点
type node struct {
	num     int         // 頂点の番号
	weights map[int]int // 重みMAP
	parent  *node       // MSTへの重み最小の親
	sum     int         // 始点からの距離
	color   color
}

func (p *node) getMinToMst() int {
	if p.parent == nil {
		return math.MaxInt32
	}
	return p.weights[p.parent.num]
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	n := eGetInt(scanner)

	nodes := make([]*node, n)
	for i := 0; i < n; i++ {
		weights := eAtoi((strings.Fields(eGetline(scanner))))
		v := &node{weights[0], make(map[int]int, weights[1]), nil, 0, white}
		for j := 0; j < weights[1]; j++ {
			k := weights[j*2+2] // 相手の頂点名
			w := weights[j*2+3] // 重み
			v.weights[k] = w
		}
		nodes[i] = v
	}

	// 初回はnode[0]がMSTに入るように
	nodes[0].parent = nodes[0]

	for { // 全部チェックするまで

		// どの頂点を新たにMSTに取り込むか

		var minNode *node
		min := math.MaxInt32
		for _, v := range nodes {
			if v.color == mst {
				continue
			}
			if v.getMinToMst() < min {
				min = v.getMinToMst()
				minNode = v
			}
		}
		if minNode == nil {
			// すべて完了している.
			break
		}

		// MSTに追加する頂点決定
		minNode.color = mst
		// 自分の親の合計値と合算する
		minNode.sum = minNode.parent.sum + min

		// MSTに属していない頂点それぞれについて,MSTとの最小の重みの距離を加算
		for _, v := range nodes {
			if v.color == mst {
				continue
			}
			w, ok := v.weights[minNode.num]
			if !ok {
				// minNodeと接してない
				continue
			}

			if w < v.getMinToMst() {
				// minNodeへの距離がもっとも重みが少ないので親を変更
				v.parent = minNode
			}
		}
	}

	for i, v := range nodes {
		fmt.Printf("%d %d\n", i, v.sum)
	}
}

func eGetInt(scanner *bufio.Scanner) int {
	t := eAtoi(strings.Fields(eGetline(scanner)))
	return t[0]
}

func eGetline(p *bufio.Scanner) string {
	if !p.Scan() {
		if err := p.Err(); err != nil {
			log.Fatal(err.Error())
		}
		return ""
	}
	return p.Text()
}

func eAtoi(s []string) []int {
	ints := make([]int, len(s))
	var err error
	for i, e := range s {
		ints[i], err = strconv.Atoi(e)
		if err != nil {
			log.Fatal(err.Error())
		}
	}
	return ints
}

C++: #include <iostream>
using namespace std;

#define MAX 100
#define INFTY (1 << 21)
#define WHITE 0
#define GRAY 1
#define BLACK 2

int n, M[MAX][MAX];

void solve(void) {
    int minv;
    int d[MAX], color[MAX];
    
    for(int i = 0; i < n; ++i) {
        d[i] = INFTY;
        color[i] = WHITE;
    }
    
    d[0] = 0;
    color[0] = GRAY;
    while(true) {
        minv = INFTY;
        int u = -1;
        for(int i = 0; i < n; ++i) {
            if(minv > d[i] && color[i] != BLACK) {
                u = i;
                minv = d[i];
            }
        }
        if(u == -1) break;
        color[u] = BLACK;
        for(int i = 0; i < n; ++i) {
            if(color[i] != BLACK && M[u][i] != INFTY) {
                if(d[i] > d[u] + M[u][i]) {
                    d[i] = d[u] + M[u][i];
                    color[i] = GRAY;
                }
            }
        }
    }
    for(int i = 0; i < n; ++i) {
        cout << i << ' ' << (d[i] == INFTY ? -1 : d[i]) << endl;
    }
}

int main(void) {
    cin >> n;
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < n; ++j) {
            M[i][j] = INFTY;
        }
    }
    
    int k, c, u, v;
    for(int i = 0; i < n; ++i) {
        cin >> u >> k;
        for(int j = 0; j < k; ++j) {
            cin >> v >> c;
            M[u][v] = c;
        }
    }
    
    solve();
    
    return 0;
}

C++: #include<bits/stdc++.h>
#define INF 1e9
#define MAX_V 100
using namespace std;
int cost[MAX_V][MAX_V];
int d[MAX_V];
bool used[MAX_V];
int V;
void dijkstra(int s){
    fill(d,d+V,INF);
    fill(used,used+V,false);
    d[s]=0;
    
    while(true){
        int v=-1;
        for(int u=0;u<V;u++){
            if(!used[u] && (v == -1 || d[u] < d[v])){
                v = u;
            }
        }
        
        if(v == -1) break;
        
        used[v] = true;
        
        for(int u=0;u<V;u++){
            d[u] = min(d[u],d[v]+cost[v][u]);
        }
    }
    
    for(int i=0;i<V;i++) cout<<i<<" "<<d[i]<<endl;

    return ;
}

int main(){
    cin>>V;
    int u,k,v,c;

    for(int i=0;i<V;i++)
        for(int j=0;j<V;j++) cost[i][j]=INF;
    
    for(int i=0;i<V;i++){
        cin>>u>>k;
        for(int j=0;j<k;j++){
            cin>>v>>c;
            cost[u][v]=c;
        }
    }
    
    dijkstra(0);
    
    return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<queue>
#include<string>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<cassert>
#include<ctime>
#include<algorithm>
#include<utility>
#include<map>
#include<set>
#include<vector>
#include<functional>

using namespace std;

#ifdef DEBUG
#define dprintf      printf
#define dout(x)      cout<<#x" = "<<(x)<<endl
#define darray(x,n)    {int i;rep(i,n)cout<<#x"["<<i<<"] = "<<*((x)+i)<<endl;}
#define dloop(i,s,g) for((i)=(s);(i)<(g);(i)++)
#define drep(i,n)    for((i)=0;(i)<(n);(i)++)
#define dstop()      scanf("%*c")
#else
#define dprintf      (1)?0:printf
#define dout(x)
#define darray(x,n)
#define dloop(i,s,g) if(1){}else
#define drep(i,n)    if(1){}else
#define dstop()      if(1){}else
#endif

#define F    first
#define S    second
#define pb   push_back
#define mp   make_pair

#define loop(i,s,g) for((i)=(s);(i)<(g);(i)++)
#define rep(i,n)    for((i)=0;(i)<(n);(i)++)
#define all(x)      (x.begin(),x.end())
#define in(T,...) T __VA_ARGS__; impl(__VA_ARGS__);
#define array(T,id,n) T id[n]; rep(i,n)cin>>id[i];

//#define int long long;
#ifndef int
#define INF  (0x7fffffff)
#else
#define LINF (0x7fffffffffffffff)
#endif

typedef long long           ll;
typedef unsigned            ui;
typedef unsigned long long  ull;
typedef pair<int,int>       i_i;
typedef pair<ll,int>        ll_i;
typedef pair<ll,ll>         ll_ll;
typedef pair<double,int>    d_i;
typedef pair<double,double> d_d;

void impl(){};
template <typename T,typename... TS >
void impl(T &head,TS &... tail)
{
  cin>>head;
  impl(tail ...);
}

typedef struct edge
{
  int to;
  int cost;
}Edge;
int V;
#define MAX_V (1000)
vector<Edge> G[MAX_V];
int d[MAX_V];

void djikstra(int s)
{
  int i;
  priority_queue<i_i,vector<i_i>,greater<i_i> > q;
  fill(d,d+V,INF);
  d[s]=0;
  q.push(i_i(0,s));
  while(!q.empty())
    {
      i_i p=q.top();
      q.pop();
      int v=p.S;
      if(d[v]<p.F)
	continue;
      rep(i,G[v].size())
	{
	  Edge e=G[v][i];
	  if(d[e.to]>d[v]+e.cost)
	    {
	      d[e.to]=d[v]+e.cost;
	      q.push(i_i(d[e.to],e.to));
	    }
	}
    }
}

signed main(void)
{
  int n;
  int i,j;
  int u;
  int k;
  Edge e;

  cin>>n;
  rep(i,n)
    {
      cin>>u>>k;
      rep(j,k)
	{ 
	  cin>>e.to>>e.cost;
	  G[j].pb(e);
	}
    }
  djikstra(0);
  rep(i,n)
    {
      cout<<i<<" "<<d[i]<<endl;
    }
  return 0;
}