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 <iostream>
using namespace std;
static const int maxs=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[maxs][maxs];

void dicstra(){
  int minv;
  int d[maxs],color[maxs];
  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;
    }
  }
  dicstra();
  return 0;
}

C++: #include <vector>
#include <queue>
#include <cstdio>
#include <utility>
#include <climits>

int main(){
	std::priority_queue<std::pair<int, int>> queue;
	int n;
	std::scanf("%d", &n);
	std::vector<std::vector<std::pair<int, int>>> edges;
	std::vector<int> result(n, INT_MAX);
	for (auto i = 0; i < n; ++i){
		std::vector<std::pair<int, int>> edge;
		int u, k;
		std::scanf("%d %d", &u, &k);
		for (auto j = 0; j < k; ++j){
			int c, v;
			std::scanf("%d %d", &v, &c);
			edge.push_back(std::make_pair(v, c));
		}
		edges.push_back(edge);
	}
	queue.push(std::make_pair(0, 0));
	for (auto i = 0; i < n; ++i){
		while (result.at(queue.top().second) < -queue.top().first){
			//std::cout << queue.top().second << "qqqq" << queue.top().first << std::endl;
			queue.pop();
		}
		int dist = -queue.top().first; int vert = queue.top().second;
		queue.pop();
		result.at(vert) = dist;
		//std::cout << vert << "v-d" << dist << std::endl;
		for (auto j : edges.at(vert)){
			//std::cout << j.first << "(" << result.at(j.first) << ")" << "||" << j.second << "\n";
			if (result.at(j.first) > dist+ j.second){
				queue.push(std::make_pair(-dist - j.second, j.first));
				result.at(j.first) = dist + j.second;
			}
		}
	}
	for (auto i = 0; i < n; ++i){
		std::printf("%d %d\n", i, result.at(i));
	}
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
static const int MAX=10000;
static const int I=(1<<20);
static const int W=0;
static const int G=1;
static const int B=2;

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

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


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

  while(!PQ.empty()){
    pair<int,int> f=PQ.top(); PQ.pop();
    int u=f.second;
    color[u]=B;

    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]==B) continue;
      if(d[v]>d[u]+adj[u][j].second){
        d[v]=d[u]+adj[u][j].second;
        PQ.push(make_pair(d[v]*(-1),v));
        color[v]=G;
      }
    }
  }


  for(int i=0;i<n;i++){
    cout << i << " " << (d[i]==I?-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));
    }
  }

  di();

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
//template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

const int INF = 1<<20;

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


void dijkstra(){
    priority_queue<pair<int, int>> PQ;
    bool visited[n];
    int d[n];

    for(int i=0; i<n; i++){
        visited[i] = false;
        d[i] = INF;
    }

    PQ.push({0, 0});
    d[0] = 0;

    while(!PQ.empty()){

        pair<int, int> p = PQ.top(); PQ.pop();
        int u = p.second;

        visited[u] = true;

        if(d[u] < p.first * (-1)) continue;
        
        for(int i=0; i<adj[u].size(); i++){
            int v = adj[u][i].first;
            if(visited[v] == false && d[v] > d[u] + adj[u][i].second){
                d[v] = d[u] + adj[u][i].second;
                PQ.push({d[v] * (-1), v});
            }
        }
    }

    for(int i=0; i<n; i++){
        printf("%d %d\n", i, d[i]);
    }

}

int main(void){
    cin >> 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;
            adj[u].push_back(make_pair(v, c));
        }
    }

    dijkstra();
}