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++: // -*- mode:c++; coding:utf-8; c-basic-offset:2; -*-
// ALDS1_12_B: Single Source Shortest Path I

#include <algorithm>
#include <cstdio>

using uint = unsigned int;

class Graph {
  const uint n_;
  uint* const g_;
  const uint INFINIT;
  
public:

  Graph(uint n) : n_(n), g_(new uint[(n_*n_)]), INFINIT(100000*(n_-1)+1) {
    std::fill_n(g_, (n_*n_), INFINIT);
  }

  ~Graph() { delete[] g_; }
  
  uint* operator [](uint i) const { return g_+(n_*i); }

  void dijkstra(uint* dist)
  {
    std::fill_n(dist, n_, INFINIT);
    auto i = 0u; // 0-start
    dist[i] = 0u;
    for (auto n = 0u; n < n_-1; ++n) {
      auto cur_min = INFINIT;
      auto cs = (*this)[i];
      auto c = dist[i];
      for (auto j = 0u; j < n_; ++j) {
        auto nc = c+cs[j];
        if (dist[j] < nc) continue;
        dist[j] = nc;
        if (cur_min > nc) {
          i = j;
          cur_min = nc;
        }
      }
    }
  }
};

int main()
{
  uint n;
  std::scanf("%u", &n);

  Graph g(n);

  uint u, k, v, c;
  for (auto i = 0u; i < n; ++i) {
    std::scanf("%u %u", &u, &k);
    for (auto j = 0u; j < k; ++j) {
      std::scanf("%u %u", &v, &c);
      g[u][v] = c;
    }
  }

  uint dist[n];
  g.dijkstra(dist);
  for (auto i = 0u; i < n; ++i) {
    std::printf("%u %u\n", i, dist[i]);
  }
}

// eof

C++: #include <iostream>
using namespace std;
const int MAXn = 100;
const int INFTY = 1 << 21;

int n, M[MAXn][MAXn], col[MAXn], d[MAXn], p[MAXn];

void dijkstra(int s) {
    for(int i = 0; i < n; i++) {
        col[i] = 0;
        d[i] = INFTY;
    }
    d[s] = 0;
    p[s] = -1;

    while(1) {
        int mincost = INFTY;
        int u;
        for(int i = 0; i < n; i++) {
            if(col[i] != 2 && d[i] < mincost) {
                mincost = d[i];
                u = i;
            }
        }
        if(mincost == INFTY) break;
        col[u] = 2;
        for(int v = 0; v < n; v++) {
            if(col[v] != 2 && M[u][v] != INFTY) {
                if(d[u] + M[u][v] < d[v]) {
                    d[v] = d[u] + M[u][v];
                    p[v] = u;
                    col[v] = 1;
                }
            }
        }
    }

    for(int i = 0; i < n; i++)
        cout << i << " " << (d[i] == INFTY ? -1 : d[i]) << endl;

    return;
}

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

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#define MAX 105
#define INF 1000000
using namespace std;

int n;
int color[MAX];//0 表示未进入 -1 表示在之中 1 表示已出去 
int p[MAX];
int M[MAX][MAX];
int d[MAX];

void dijkstra() {
	int i,j,u;
	d[0]=0;
	p[0]=-1;
	while(1) {
		int min=INF;
		u=-1;
		for(i=0;i<n;i++) {
			if(d[i]<min && color[i]!=1) {
				min=d[i];
				u=i;
			}
		}
		if(u==-1) break;
		color[u]=1;
		for(j=0;j<n;j++) {
			if(color[j]!=1 && d[j]>min+M[u][j]) {
				color[j]=-1;
				d[j]=min+M[u][j];
				p[j]=u;
			}
		}
	}
}

int main() {
	memset(d,INF,sizeof(d));
	memset(color,0,sizeof(color));
	memset(p,-1,sizeof(p));
	memset(M,INF,sizeof(M));
	int i,j,u,k,v,c;
	cin>>n;
	for(i=0;i<n;i++) {
		cin>>u>>k;
		for(j=0;j<k;j++) {
			cin>>v>>c;
			M[u][v]=c;
		}
	}
	dijkstra();
	for(i=0;i<n;i++) {
		cout<<i<<' '<<d[i]<<endl;
	}
	return 0;	
}

C++: #include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n,M[MAX][MAX];
void dijkstra(){
    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(1){
        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 v=0;v<n;v++){
            if(color[v]!=BLACK&&M[u][v]!=INFTY){
                if(d[v]>d[u]+M[u][v]){
                    d[v]=d[u]+M[u][v];
                    color[v]=GRAY;
                }
            }
        }
    }
    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++){
        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;
        }
    }
    dijkstra();
    return 0;
}