Go: package main

import (
	"fmt"
	"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)

	g := make([][]int, n)
	c := make([][]int, n)
	pq := make(PriorityQueue, 0, n)
	d := make([]int, n)
	for i := 0; i < n; i++ {
		var u,k int
		fmt.Scan(&u)
		fmt.Scan(&k)
		g[u] = make([]int, k)
		c[u] = make([]int, k)
		for j := 0; j < k; j++ {
			fmt.Scan(&g[u][j])
			fmt.Scan(&c[u][j])
		}

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

	for i := 0; i < n; i++ {
		fmt.Println(i, d[i])
	}
}

C++: #include <map>
#include <vector>
#include <cstdio>
using namespace std;
int main(){
	int n=0,N,i,j,k,c;
	scanf("%d",&N);
	vector<map<int,int> >dist(N);
	vector<bool>used(N);
	vector<int>cost(N);
	for(;n<N;n++){
		cost[n]=9999999;
		for(scanf("%d%d",&i,&k);k--;dist[i][j]=c)scanf("%d%d",&j,&c); //i->j cost c
	}
	for(cost[0]=0;;){ //dijkstra
		int m=9999999;
		for(i=0;i<N;i++)if(!used[i]&&m>cost[i])m=cost[i];
		if(m==9999999)break;
		for(j=0;j<N;j++)if(m==cost[j]){
			map<int,int>::iterator it=dist[j].begin();
			for(used[j]=1;it!=dist[j].end();it++)if(cost[it->first]>it->second+cost[j])cost[it->first]=it->second+cost[j];
		}
	}
	for(i=0;i<n;i++)printf("%d %d\n",i,cost[i]);
}

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][v]+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++){
    xin >> u >> k;
    for(int j=0;j<k;j++){
      xin >> v >>c;
      M[u][v]=c;
    }
  }
  dijkstra();

  return 0;
}

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

const int INF = 1000000000;
int d[110][110];

int main(){
  int n; cin >> n;
  for(int i=0; i<n; i++){
    for(int j=0; j<n; j++){
      d[i][j] = INF;
      if(i == j) d[i][j] = 0;
    }
    int u, k; cin >> u >> k;
    for(int j=0; j<k; j++){
      int v, c; cin >> v >> c;
      d[u][v] = c;
    }
  }
  for(int k=0; k<n; k++){
    for(int i=0; i<n; i++){
      for(int j=0; j<n; j++){
        d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
      }
    }
  }
  for(int i=0; i<n; i++){
    cout << i << " " << d[0][i] << endl;
  }
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
#include<list>
using namespace std;
typedef  long long int lint;
//typedef pair<int, int> IP;
typedef pair<lint, lint> LLP;
typedef pair<char, char>CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define llower(v,hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v,hoge) *upper_bound(v.begin(), v.end(), hoge)
#define mp make_pair
#define P pair<int,int>

int main() {
	int INF = 100000000;
	int V;
	cin >> V;
	vector<vector<P>>G(V);
	rep(i, V) {
		int v, k;
		cin >> v >> k;
		rep(j, k) {
			int tmpv, tmpc;
			cin >> tmpv >> tmpc;
			G[i].push_back(mp(tmpv, tmpc));
		}
	}
	int start = 0;//スタート位置
	vector<int>dist(V, INF);//startからの距離を入れる配列。INF(未訪問)で初期化
	dist[start] = 0;
	priority_queue<P, vector<P>, greater<P>>que;//少ない値を優先するプライオリティキューを宣言
	que.push(mp(dist[start], start));

	while (!que.empty()) {
		P p = que.top();
		int v = p.second;
		que.pop();
		if (dist[v] < p.first)continue;
		for (int i = 0; i < G[v].size(); i++) {
			P e = G[v][i];
			int u = e.first, cst = e.second;
			if (dist[u] > dist[v] + cst) {
				dist[u] = dist[v] + cst;
				que.push(mp(dist[u], u));
			}
		}
	}
	rep(i, V) {
		cout << i << ' ' << dist[i] << endl;
	}
}

C++: 
#include <iostream>
static const  int INFTY = 100000000;
static const  int WHITE =0;
static const  int GRAY= 10;
static const  int BLACK = 100;

using namespace std;

void  dijkstra(int n,int M[100][100]) {
	int color[100], d[100],p[100];
	for (int i = 0; i < n; i++) {
		color[i] = WHITE;
		d[i] = INFTY;
	}
	d[0] = 0;
	p[0] = -1;

	int u = -1;
	while (1) {
		int mincost = INFTY;
		for (int i = 0; i < n; i++) {
			if (d[i] < mincost &&color[i] != BLACK) {
				 u = i;
				 mincost = d[i];
			}
		}
		if (mincost == INFTY) 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];
					p[v] = u;
					color[v] = GRAY;
				}
			}
		}
	}
	for (int i = 0; i < n; i++) {
		cout << i << " " << (d[i] == INFTY ? -1 : d[i]) << endl;
	}
}


int main() {
	int  n,u, k, v,c;
	int M[100][100];
	cin >> n;

	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 >> u >> k;
		
		for (int j = 0; j < k; j++) {
			cin >> v >> c;;
			M[u][v] = c;
		}
	}

	dijkstra(n,M);
	return 0;
}

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

int n, M[N][N];

void dijkstra() {
    int color[n], d[n], p[n];
    for (int i = 0; i < n; i++) {
        color[i] = WHITE;
        d[i] = INF;
    }
    int s = 0;
    d[s] = 0;

    while(true) {
        int v = -1;
        int minv = INF;
        for (int i = 0; i < n; i++) {
            if (color[i] != BLACK && minv > d[i]) {
                v = i;
                minv = d[i];
            }
        }
        if (v == -1) break;
        color[v] = BLACK;
        for (int u = 0; u < n; u++) {
            if (color[u] != BLACK && M[v][u] != INF){
                if (d[u] > d[v] + M[v][u]){
                    d[u] = d[v] + M[v][u];
                    color[u] = GRAY;
                }
            }
        }

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

}

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