Go: package main

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

type Item struct {
	value    int // The value of the item; arbitrary.
	priority int // The priority of the item in the queue.
	// The index is needed by update and is maintained by the heap.Interface methods.
	index int // The index of the item in the heap.
}
type PriorityQueue []*Item

func (pq PriorityQueue) Len() int { return len(pq) }
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 = i
	pq[j].index = j
}
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
}

type Q struct {
	pq *PriorityQueue
	ds map[int]int // It has always same value as pq. For random access.
}

func newQ() *Q {
	pq := new(PriorityQueue)
	heap.Init(pq)
	return &Q{
		pq: pq,
		ds: make(map[int]int),
	}
}
func (q *Q) pop() (u, d int) {
	item := heap.Pop(q.pq).(*Item)
	delete(q.ds, item.value)
	return item.value, item.priority
}
func (q *Q) get(u int) (int, bool) { // returns d
	d, ok := q.ds[u]
	return d, ok
}
func (q *Q) set(u, d int) {
	q.ds[u] = d
	for _, item := range *q.pq {
		if item.value != u {
			continue
		}

		item.priority = d
		heap.Fix(q.pq, item.index)
		return
	}
	heap.Push(q.pq, &Item{
		priority: d,
		value:    u,
	})
}
func (q *Q) len() int {
	return len(q.ds)
}

func main() {
	r := bufio.NewReader(os.Stdin)

	var n int
	fmt.Fscan(r, &n)
	cs := make([]map[int]int, n) // []v_i -> c_i
	for h := 0; h < n; h++ {
		var u, k int
		fmt.Fscan(r, &u, &k)
		m := make(map[int]int)
		for i := 0; i < k; i++ {
			var v, c int
			fmt.Fscan(r, &v, &c)
			m[v] = c
		}

		cs[u] = m
	}

	q := newQ()
	q.set(0, 0)
	visited := make(map[int]struct{})
	out := make([]int, n)

	for q.len() > 0 {
		u, d := q.pop()
		for uu, c := range cs[u] {
			// Consider the connection between u and uu.
			if _, ok := visited[uu]; ok {
				continue
			}
			dd := d + c
			if d, ok := q.get(uu); !ok || d > dd {
				q.set(uu, dd)
			}
		}

		out[u] = d
		visited[u] = struct{}{}
	}

	for u, d := range out {
		fmt.Println(u, d)
	}
}

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

int cost[100][100];//cost[a][b] a??????b????§?????????????????????????
long long int d[100];//??????s?????????????°??????¢
bool used[100];
int arrow;//????????°

const int INF = 10000000;

void dijkstra(){
  fill(d,d+arrow,INF);
  fill(used,used + arrow,false);
  d[0] = 0;

  while(1){
    int v=-1;
    // ???????????????????????????????????????????????¢???????°???????????????¢???
    for(int u=0;u<arrow;u++){
      if(!used[u] && (v == -1 || d[u] < d[v])) v = u;
    }

    if(v == -1) break;

    used[v] = true;

    for(int u=0; u<arrow; u++){
      if(cost[v][u] != INF){
        d[u] = min(d[u],d[v] + cost[v][u]);
      }
    }
  }

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

}

int main(){

    cin >> arrow;

    int n,a,v,c;



    for(int i=0;i<arrow;i++){
      for(int j=0;j<arrow;j++){
        cost[i][j] = INF;
      }
    }

    for(int u=0;u<arrow;u++){

      cin >> n >> a;

      for(int i=0; i<a;i++){
        cin >> v >> c;
        cost[n][v] = c;
      }
    }

    dijkstra();

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
typedef pair<int,int> pp;
const int INF = 1001001001;
struct edge{int to, cost;};

int main() {
    int V;
    cin >> V;
    vector< vector<edge> > A(V);
    for(int i=0; i<V; i++) {
        int u,k;
        cin >> u >> k;
        A[u].resize(k);
        for(int j=0; j<k; j++) {
            int v,c;
            cin >> v >> c;
            struct edge e = {v,c};
            A[u][j] = e;
        }
    }

    vector<int> d(V,INF);
    d[0] = 0;
    priority_queue< pp, vector<pp>, greater<pp> > Q;
    Q.push(pp(d[0],0));
    
    while(!(Q.empty())) {
        pp temp = Q.top();
        Q.pop();
        int ct = temp.first;
        int u = temp.second;
        for(int j=0; j<A[u].size(); j++) {
            int v = A[u][j].to;
            int tmpcost = A[u][j].cost;
            if(d[v] > ct + tmpcost) {
                d[v] = ct + tmpcost;
                Q.push(pp(d[v], v));
            }
        }
    }

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

C++: #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;

const int INF = numeric_limits<int>::max();

struct Graph {
    struct edge {
        int v, c;
    };
    vector<vector<edge>> adj;
    vector<int> d;
    Graph(int n) {
        adj.assign(n, vector<edge>());
        d.assign(n, INF);
    }
};

int main()
{
    int n;
    cin >> n;
    Graph g(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;
            g.adj[i].push_back({v, c});
        }
    }

    priority_queue<P, vector<P>, greater<P>> pq;
    g.d[0] = 0;
    pq.push(P(0, 0));
    while (!pq.empty()) {
        int c = pq.top().first;
        int u = pq.top().second;
        pq.pop();
        if (g.d[u] < c) continue;
        for (auto e : g.adj[u]) {
            if (g.d[e.v] > g.d[u] + e.c) {
                g.d[e.v] = g.d[u] + e.c;
                pq.push(P(g.d[e.v], e.v));
            }
        }
    }

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

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
static const int R =10000;
static const int IF = (1<<20);
static const int WH = 0;
static const int GR =1;
static const int BL =2;

int num;
vector<pair<int,int> > ax[R];

void dx(){
  priority_queue<pair<int,int> > Pi;
  int IR[R],i,j,y,x;
  int D[R];

  for(i=0;i<num;i++){
    D[i] = IF;
    IR[i] = WH;
  }

  D[0] = 0;
  Pi.push(make_pair(0,0));
  IR[0] =GR;

  while(!Pi.empty()){
    pair<int,int> F=Pi.top();
    Pi.pop();
    x =F.second;

    IR[x] =BL;

    if(D[x] < F.first * (-1)){
      continue;
    }

    for(j=0;j<ax[x].size();j++){
       y= ax[x][j].first;
       
      if(IR[y] ==BL){
	continue;
      }
      if(D[y] > D[x] + ax[x][j].second){
	 D[y] = D[x] + ax[x][j].second;
	 Pi.push(make_pair(D[y] * (-1),y));
	 IR[y] = GR;
	 }
    }
  }

  for(int i=0;i<num;i++){
    cout << i << " " << (D[i] == IF ? -1 : D[i] ) << endl;
  }
}

int main(){
  int z,x,y,ci,i,j;

  cin >> num;
  for(i=0;i<num;i++){
    cin >> x >> z;

    for(j=0;j<z;j++){
      cin >> y >> ci;
      ax[x].push_back(make_pair(y,ci));
    }
  }
  dx();

  return 0;
}

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

int n;
vector<pair<int, int>> adj[MAX];

void dijkstra() {
	priority_queue<pair<int, int>> PQ;
	int color[MAX];
	int d[MAX];
	for (int i = 0; i < n; i++) {
		d[i] = INFTY;
		color[i] = WHITE;
	}

	d[0] = 0;
	PQ.push(make_pair(0, 0));
	color[0] = GRAY;

	while (!PQ.empty()) {
		pair<int, int> f = PQ.top();
		PQ.pop();
		int 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)continue;
			if (d[v] > d[v] + adj[u][j].second) {
				d[v] = d[u] + adj[u][j].second;
				PQ.push(make_pair(d[v] * (-1), v));
				color[v] = GRAY;
			}
		}
	}

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

int main() {
	int k, u, v, c;

	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> u >> k;
		for (int j = 0; j < k; j++) {
			cin >> v >> c;
			adj[u].push_back(make_pair(v, c));
		}
	}

	dijkstra();

	return 0;
}