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
	heap.Init(&pq)

	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<<21);
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<n; j++){
            cin >> v >> c;
            adj[u].push_back(make_pair(v, c));
        }
    }
    
    dijkstra();
    
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

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];

// int prim() {
//    int u, minv;
//    int d[MAX], p[MAX], color[MAX];

//    // 初期化
//    rep(i, n) {
//       d[i] = INFTY;
//       p[i] = -1;
//       color[i] = WHITE;
//    }

//    d[0] = 0;

//    while(1) {
//       minv = INFTY;
//       u = -1;

//       rep(i, n){
//          if (minv > d[i] && color[i] != BLACK) {
//             u = i;
//             minv = d[i];
//          }
//       }
//       if(u == -1) break;
//       // uの決定
//       color[u] = BLACK;

//       rep(v, n) {
//          if(color[v] != BLACK && M[u][v] != INFTY) {
//             if(d[v] > M[u][v]) {
//                d[v] = M[u][v];
//                p[v] = u;
//                color[v] = GRAY;
//             }
//          }
//       }
//    }
//    int sum = 0;
//    rep(i, n) {
//       if(p[i] != -1) sum += M[i][p[i]];
//    }
//    return sum;
// }

// void dijkstra() {
//    int minv;
//    int d[MAX], color[MAX];

//    // 初期化
//    rep(i, n) {
//       d[i] = INFTY;
//       color[i] = WHITE;
//    }

//    d[0] = 0;
//    color[0] = GRAY;

//    while(true) {
//       minv = INFTY;
//       int u = -1;
//       rep(i, n) {
//          if(minv > d[i] && color[i] != BLACK) {
//             u = i;
//             minv = d[i];
//          }
//       }
//       if (u == -1) break;

//       // 最も小さいコストのuが決まる 初回は必ず0になる
//       color[u] = BLACK;

//       rep(v, n) {
//          // 0 ~ n-1の頂点が未訪問かつuとの経路がある場合
//          if(color[v] != BLACK && M[u][v] != INFTY) {
//             // 頂点uを通った方が目的地に近い場合
//             if (d[v] > d[u] + M[u][v]) {
//                d[v] = d[u] + M[u][v];
//                color[v] = GRAY;
//             }
//          }
//       }
//    }

//    rep(i, n) {
//       cout << i << " " << (d[i] == INFTY ? -1 : d[i]) << endl;
//    }
// }

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

   rep(i, n) {
      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;

      rep(j, adj[u].size()) {
         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;
         }
      }
   }
   rep(i, n) {
      cout << i << " " << (d[i] == INFTY ? -1 : d[i]) << endl;
   }
}


int main(){
   cin >> n;
   int k, c, u, v;
   rep(i, n) {
      cin >> u >> k;
      rep(j, k){
         // v は頂点 cはコスト
         cin >> v >> c;
         adj[u].push_back(make_pair(v, c));
      }
   }

   dijkstra();

   return 0;
}