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<algorithm>
#include<queue>
#include<cstdio>
using namespace std;
const int MAX = 10000;
const int INF = (1 << 31) - 1;
const int WHITE = 0,GRAY = 1,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] = INF;
        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[u] + 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) printf("%d %d\n",i,d[i] == INF ? -1:d[i]);
}

int main(){
    int k,u,v,c;
    scanf("%d",&n);
    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(v,c));
        }
    }
    dijkstra();
}

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[u] + 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;
}

C++: #include <iostream>
#include <vector>
#include <queue>

using namespace std;

#define MAX 10000
#define INF 1000000
#define pii pair<int,int>

vector<pii> eclist[MAX];//[[index,cost]]

void bfs(int start,int n){
    queue<int> q; // index
    vector<bool> visited(n, false);
    q.push(start);
    while (!q.empty()){
        int u = q.front();q.pop();
        visited[u] = true;
        for (pii vpair : eclist[u]) {
            int v = vpair.first;
            if(!visited[v]){
                q.push(v);
            }
        }
    }
}

void dijkstra_print_distance(int start, int n){
    priority_queue<pii> q; // cost,index
    vector<int> costs(n,INF);
    vector<bool> visited(n, false);
    costs[0] = 0;
    q.push(make_pair(0, start));
    while (!q.empty()){
        pii upair = q.top();q.pop();
        int u = upair.second,ucost = upair.first * -1;
        visited[u] = true;
        if( costs[u] < ucost) {
            continue;
        }
        for (pii vpair : eclist[u]) {
            int v = vpair.first,vcost = vpair.second;
            if(visited[v])continue;
            if (costs[v] > costs[u] + vcost){
                costs[v] = costs[u] + vcost;
                q.push(pii(costs[v] * -1, v));
            }
        }
    }
    for (int i = 0; i < n; ++i) cout << i << " " << costs[i] << endl;
}

int main(){
    //freopen("in", "r", stdin);
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int id,m,v,c;
        cin >> id >> m;
        for (int j = 0; j < m; ++j) {
            cin >> v >> c;
            eclist[id].push_back(pair<int,int>(v,c));
        }
    }

    dijkstra_print_distance(0, n);

    return 0;
}