Go: package main

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

//make priority queue
type Item struct {
	id       int
	priority int // this state is priority and distans from start
	index    int
}

type PriorityQueue []*Item

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

// we want the ascending-priority-queue.
// So we use less than here.
func (pq PriorityQueue) Less(i, j int) bool {
	return pq[i].priority < pq[j].priority
}

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

func (pq *PriorityQueue) Push(x interface{}) {
	n := len(*pq)
	item := x.(*Item)
	item.index = n
	*pq = append(*pq, item)
}

func (pq *PriorityQueue) Pop() interface{} {
	old := *pq
	n := len(old)
	item := old[n-1]
	item.index = -1 //for safety
	*pq = old[0 : n-1]
	return item
}

func (pq *PriorityQueue) update(dist int, id int) {
	for _, i := range *pq {
		if i.id == id {
			if i.priority > dist {
				i.priority = dist
			}
		}
	}
}

// the main code
func nextInt(sc *bufio.Scanner) int {
	sc.Scan()
	n, _ := strconv.Atoi(sc.Text())
	return n
}

func dikstra(dist [][]int, n int) []int {
	// preparate priority queue
	inf := 1 << 30
	pq := make(PriorityQueue, n)
	shortests := make([]int, n)
	for i := 0; i < n; i++ {
		pq[i] = &Item{
			id:       i,
			priority: inf,
			index:    i,
		}

		shortests[i] = inf
	}
	pq[0].priority = 0
	shortests[0] = 0
	heap.Init(&pq)

	for pq.Len() > 0 {
		item := heap.Pop(&pq).(*Item)
		shortests[item.id] = item.priority
		for id, d := range dist[item.id] {
			if d != -1 {
				pq.update(item.priority+d, id)
			}
		}
		heap.Init(&pq)
	}
	return shortests
}

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

	// init
	n := nextInt(sc)
	dist := make([][]int, n)
	for i := 0; i < n; i++ {
		dist[i] = make([]int, n)
		for j := 0; j < n; j++ {
			dist[i][j] = -1
		}
	}

	// std Input
	for i := 0; i < n; i++ {
		u := nextInt(sc)
		k := nextInt(sc)
		for j := 0; j < k; j++ {
			v, c := nextInt(sc), nextInt(sc)
			dist[u][v] = c
		}
	}

	shortests := dikstra(dist, n)
	for i, d := range shortests {
		fmt.Printf("%d %d\n", i, d)
	}
}

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

C++: #include <iostream>
#include <cstdio>
#include <climits>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#define MAX 100
#define INFTY 1<<30 // 2^30
using namespace std;
typedef long long llong;
static const int NIL = -1;
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 == NIL) 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;
}

C++: #include <bits/stdc++.h>
using ll = long long;
using namespace std;

#define INFint 2e9+1

ll gcd(ll a, ll b) { return __gcd(a,b); } //最大公約数
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; } //最大公倍数

int main(){
// start
  struct edge {int to,cost;};
  int N;
  cin>>N;
  vector<vector<edge>> G(N,vector<edge>());
  for(int i(0);i<N;i++){
    int k,u;
    cin>>k>>u;
    for(int j(0);j<u;j++){
      int v,c;
      cin>>v>>c;
      G[k].push_back({v,c});
    }
  }
  vector<int> d(N); //各頂点の最小値を入れる配列
  fill(d.begin(),d.end(),INFint);
  // first: cont, second: node number 
  priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;
  int start = 0;
  d[start] = 0;
  q.push({0,start});

  while(!q.empty()){
    pair<int,int> p = q.top();q.pop();                                                  
    int v = p.second;
    if (d[v] < p.first) continue;
    for (int i(0);i<int(G[v].size());i++){
      edge e = G[v][i];
      if (d[e.to] > d[v] + e.cost){
        d[e.to] = d[v] + e.cost;
        q.push({d[e.to],e.to});
      }
    }
  }
// end
  for(int i(0);i<N;i++){
    cout << i <<" " << d[i] << endl;
  }
  return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath> 
using namespace std;
typedef long long ll;

const ll INF = 0x3f3f3f3f ;
const int maxn = 105;
ll maps[105][105];

int main(){
	ll n,m;
	ll from,to,len;
	while(scanf("%lld",&n)!=EOF){
		for(ll i=0;i<105;i++){
			for(ll j=0;j<105;j++) {
				if(i==j) maps[i][j]=0;
				else	maps[i][j]=INF;
			}
		}
		int sum=n;
		while(n--){
			ll node,t;
			ll to,len;
			scanf("%lld%lld",&node,&t);
			for(ll i=1;i<=t;i++){
				scanf("%lld%lld",&to,&len);
					if(maps[node][to]>len){
						maps[node][to]=len;
						maps[to][node]=len;
					}	
			}	
		}
		for(ll k=0;k<sum;k++){
			for(ll i=0;i<sum;i++){
				for(ll j=0;j<sum;j++){
					if(maps[i][j]>maps[i][k]+maps[k][j]){
						maps[i][j]=maps[i][k]+maps[k][j];
					}
				}
			}
		}
		for(ll i=0;i<sum;i++)
			printf("%lld %lld\n",i,maps[0][i]);
	}
	return 0;
}