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>
using namespace std;
static const int MAX = 10000;
static const int INFTY = (1<<20);

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

void dij(){
  priority_queue<pair<int,int> > PQ;
  int color[MAX], d[MAX], i, j, u, v;
  for(i = 0; i < n; i++){
    d[i] = INFTY;
    color[i] = 0;
  }
  d[0] = 0;
  PQ.push(make_pair(0,0));
  color[0] = 1;

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

    if(d[u] < f.first * (-1)) continue;
    for(j = 0; j < G[u].size(); j++){
      v = G[u][j].first;
      if(color[v] == 2) continue;
      if(d[v] > d[u] + G[u][j].second){
        d[v] =  d[u] + G[u][j].second;
        PQ.push(make_pair(d[v] * (-1), v));
        color[v] = 1;
      }
    }
  }

  for(i = 0; i < n; i++){
    cout << i << " " << (d[i] == INFTY ? -1 : d[i]) << endl;
  }
}
int main()
{
  int k, u, v, c, i, j;

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

  dij();
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

const int MAX = 10000;
const int INF = 1e9 + 7;

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

void dijkstra()
{
  int d[MAX], color[MAX];
  priority_queue<pair<int, int> > pq;

  fill(d, d + MAX, INF);
  fill(color, color + MAX, 0);

  d[0] = 0;
  pq.push(make_pair(0, 0));
  color[0] = 1;

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

    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] == 2) 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] = 1;
      }
    }
  }
  
  for (int i = 0; i < n; i++) 
    cout << i << " " << (d[i] == INF ? -1 : d[i]) << endl;
  }
}

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

  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<algorithm>
#include<queue>
#define MAX 10000
int INF=(1<<20), WH=0, GR=1, BL=2;
int n;
std::vector<std::pair<int,int> > adj[MAX];
void dij(void);
int main(){
  int k, u, v, c;
  std::cin >> n;
  for(int i=0; i<n; i++){
    std::cin >> u >> k;
    for(int j=0; j<k; j++){
      std::cin >> v >> c;
      adj[u].push_back(std::make_pair(v,c));
    }
  }
  dij();
  return 0;
}
void dij(void){
  std::priority_queue<std::pair<int,int> > PQ;
  int color[MAX], d[MAX];
  for(int i=0; i<n; i++) d[i] = INF, color[i] = WH;
  d[0] = 0;
  PQ.push(std::make_pair(0,0));
  color[0] = GR;
  while(!PQ.empty()){
    std::pair<int,int> f=PQ.top(); PQ.pop();
    int u=f.second;
    color[u] = BL;
    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] == BL) continue;
      if(d[v] > d[u] + adj[u][j].second){
	d[v] = d[u] + adj[u][j].second;
	PQ.push(std::make_pair(d[v]*(-1),v));
      }
    }
  }
  for(int i=0; i<n; i++) std::cout << i << " " << (d[i] == INF ? -1 : d[i]) << std::endl;
}