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

	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>
#include <utility>
#include <queue>
#include <limits>

using namespace std;

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

int n,d[MAX];
vector<pair<int,int> > list[MAX];

void dijkstra(){
  //initialize as min-Heap
  priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > PQ;
  bool visited[n];
  for(int i=0;i<n;i++){
    visited[i]=false;
    d[i]=INF;
  }
  d[0]=0;
  PQ.push(make_pair(0,0));
  while(!PQ.empty()){
    pair<int,int> f=PQ.top(); PQ.pop();
    int u=f.second;
    visited[u]=true;

    //if(d[u]>f.first) continue;

    for(int i=0;i<list[u].size();i++){
      int v=list[u][i].first;
      if(visited[v]==false && d[v]>d[u]+list[u][i].second){
        d[v]=d[u]+list[u][i].second;
        PQ.push(make_pair(d[v],v));
      }
    }
  }
}

int main(){
  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;
      list[u].push_back(make_pair(v,c));
    }
  }
  dijkstra();
  for(int i=0;i<n;i++)
    cout << i << " " << d[i] << endl;
}

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 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD = 1000000007;

int main() {
    int N; cin >> N;
    vector<vector<pair<int, int>>> 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[u].push_back(make_pair(v, c));
        }
    }
    vector<int> d(N, MAX);
    vector<bool> checked(N, false);
    priority_queue<pair<int, int>> pq;
    d[0] = 0;
    pq.push(make_pair(0, 0));

    while (!pq.empty()) {
        auto p = pq.top();
        pq.pop();
        int v = p.second;
        
        if (d[v] < p.first * (-1)) continue;
        checked[v] = true;


        for (auto np : G[v]) {
            int nv = np.first;
            if (checked[nv]) continue;

            if (chmin(d[nv], d[v] + np.second)) pq.push(make_pair(d[nv] * (-1), nv));
        }
    }

    for (int v = 0; v < N; v++) {
        cout << v << " " << d[v] << "\n";
    }
    return 0;
}

C++: #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]; // Adjacency list

void dijkstra(int s) {
    priority_queue<pair<int, int> > PQ;
    int color[n], d[n], p[n];
    for (int i=0; i<n; i++) {
        color[i] = WHITE;
        d[i] = INFTY;
    }
    d[s] = 0;
    PQ.push(make_pair(0, s));
    color[s] = 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; // Not the minimum
        }

        for (int j=0; j<adj[u].size(); j++) {
            int v = adj[u][j].second;
            if (color[v]==BLACK) {
                continue;
            }
            int tmp = d[u] + adj[u][j].first;
            if (tmp < d[v]) {
                d[v] = tmp;
                color[v] = GRAY;
                PQ.push(make_pair(d[v]*(-1), v)); // Descending order
            }
        }
    }

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

int main() {
    scanf("%d", &n);
    int u, k, v, c;
    for (int i=0; i<n; i++) {
        scanf("%d %d", &u, &k);
        for (int j=0; j<k; j++) {
            scanf("%d %d", &v, &c);
            adj[u].push_back(make_pair(c, v));
        }
    }
 
    dijkstra(0);
    return 0;
}