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 <vector>
#include <queue>
using namespace std;
static const int MAX = 10000;
static const int INFTY = (1<<21);

int main()
{
  int n;
  vector<pair<int,int>> adj[MAX];

  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].emplace_back(v, c);
    }
  }

  priority_queue<pair<int,int>> PQ;
  int d[MAX];
  bool visited[MAX];
  for (int i = 0; i < n; ++i)
  {
    d[i] = INFTY;
    visited[i] = false;
  }
  d[0] = 0;
  PQ.emplace(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 * (-1)) continue;

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

  for (int i = 0; i < n; ++i)
  {
    cout << i << " " << d[i] << endl;
  }

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
struct node{
	int v,c;
	bool operator<(const node&p)const{
		return c>p.c;
	}
};
int d[100005];
vector<node> e[100005];
bool ok[100005];
int n;
void solve(){
	priority_queue<node> q;
	ok[0]=1;
	for(int i=0;i<e[0].size();i++)q.push(e[0][i]);
	int k=1;
	while(k!=n){
		node v=q.top();q.pop();
		if(ok[v.v])continue;
		d[v.v]=v.c;
		ok[v.v]=1;
		k++;
		for(int j=0;j<e[v.v].size();j++)
			q.push({e[v.v][j].v,e[v.v][j].c+v.c});
	}
	for(int i=0;i<n;i++)
		cout<<i<<' '<<d[i]<<"\n";
}
int main(){
//	freopen("a.txt","r",stdin);
	cin.tie(0);
	int u,v,k,c;
	cin>>n;
	while(cin>>u>>k){
		for(int i=0;i<k;i++){
			cin>>v>>c;
			e[u].push_back({v,c});
		}
	}
	solve();
	return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<vector<pair<int, int> > > vvp;
typedef vector<pair<int,int> > vp;
typedef vector<vector<int> > vvi;
typedef vector<int> vi;
typedef vector<vector<bool> > vvb;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef pair<string, int> psi;
typedef pair<int, int> pii;
#define rep(i,s,n) for(int i = (s); i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define yn(f) (f?"yes":"no")
#define YN(f) (f?"YES":"NO")
#define Yn(f) (f?"Yes":"No")
#define mod 1000000007
#define intmax 2147483647
#define intmin -2147483648
#define longmax 9223372036854775807
#define longmin -9223372036854775808
#define black 0
#define gray 127
#define white 255
int main() {
	int N;
	cin >> N;
	vvp A(N);
	for (int i = 0; i < N; i++)
	{
		int u,k;
		cin >> u>>k;
		for (int j = 0; j < k; j++)
		{
			int v, w;
			cin >> v >> w;
			A[u].push_back(make_pair(v,w));
		}
	}
	vi color(N,black);
	priority_queue<pii,vp,greater<pii> > pq;
	vi mincost(N,intmax);
	color[0] = gray;
	pq.push(make_pair(0,0));
	mincost[0] = 0;
	while (!pq.empty()) {
		pii minp = pq.top();
		pq.pop();
		color[minp.second] = white;
		if (mincost[minp.second]<minp.first) continue; 
		for (int i = 0; i < A[minp.second].size(); i++)
		{
			int u = A[minp.second][i].first;
			if (color[u]!=white&&mincost[u]>mincost[minp.second]+ A[minp.second][i].second) {
				mincost[u] = mincost[minp.second] + A[minp.second][i].second;
				pq.push(make_pair(mincost[u],u));
				color[u] = gray;
			}
		}
	}
	for (int i = 0; i < N; i++)
	{
		cout << i << " " << mincost[i] << endl;
	}
};

C++: #include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ll;

#define EPS (1e-7)
#define INF (1<<20)
#define PI (acos(-1))
#define MAX 10000
#define WHITE  0
#define GRAY  1
#define BLACK  2

int N;
vector< pair<int, int> > G[MAX]; // targetの先と、重みのペアが保存されている

void dijkstra(int s) { // sはスタート地点
    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)); // d, vの順で入っている
    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< G[u].size(); j++) {
            int v =  G[u][j].first; //　隣接する頂点の取り出し
            if ( color[v] == BLACK) 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] = GRAY;
            }
        }
    }
    for(int i=0; i<N; i++) {
        cout << i << " " << (d[i] == INF ? -1 : d[i])  << endl;
    }
}

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

    cin >> N;
    for(int i=0; i<N; i++) {
        cin >> u >> k;

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

    dijkstra(0);
    return 0;
}