Go: package main

import (
	"fmt"
	"bufio"
	"os"
	"strconv"
	"container/heap"
)

type Node struct {
	Id int
	Dis int
}

type PriorityQueue []*Node

func (pq PriorityQueue) Len() int { return len(pq) }

func (pq PriorityQueue) Less(i, j int) bool {
	return pq[i].Dis < pq[j].Dis
}

func (pq PriorityQueue) Swap(i, j int) {
	pq[i], pq[j] = pq[j], pq[i]
}

func (pq *PriorityQueue) Push(x interface{}) {
	*pq = append(*pq, x.(*Node))
}

func (pq *PriorityQueue) Pop() interface{} {
	n := len(*pq)
	pop := (*pq)[n-1]
	*pq = (*pq)[0:n-1]
	return pop
}

func main() {
	var n int
	fmt.Scan(&n)

	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	g := make([][]int, n)
	c := make([][]int, n)
	pq := make(PriorityQueue, 0, n)
	d := make([]int, n)
	for i := 0; i < n; i++ {
		sc.Scan()
		u, _ := strconv.Atoi(sc.Text())
		sc.Scan()
		k, _ := strconv.Atoi(sc.Text())
		g[u] = make([]int, k)
		c[u] = make([]int, k)
		for j := 0; j < k; j++ {
			sc.Scan()
			g[u][j], _ = strconv.Atoi(sc.Text())
			sc.Scan()
			c[u][j], _ = strconv.Atoi(sc.Text())
		}

		if u == 0 {
			d[u] = 0
		} else {
			d[u] = 1 << 30
		}
		pq.Push(&Node{u, d[u]})
	}
	heap.Init(&pq)

	for pq.Len() > 0 {
		node := heap.Pop(&pq).(*Node)
		for i := 0; i < len(g[node.Id]); i++ {
			nextId := g[node.Id][i]
			nextDis := node.Dis + c[node.Id][i]
			if nextDis < d[nextId] {
				d[nextId] = nextDis
				heap.Push(&pq, &Node{nextId, nextDis})
			}
		}
	}

	wr := bufio.NewWriter(os.Stdout)
	for i := 0; i < n; i++ {
		wr.WriteString(strconv.Itoa(i))
		wr.WriteString(" ")
		wr.WriteString(strconv.Itoa(d[i]))
		wr.WriteString("\n")
	}
	wr.Flush()
}

C++: #include <bits/stdc++.h>
using namespace std;
#define MAX 10000
static const int INFTY = (1 << 20);
#define WHITE 0
#define BLACK 1

// グラフの頂点数
int n;
// 隣接リスト表現(第1成分は頂点番号、第2成分は辺の重み)
vector<vector<pair<int, int> > > G(MAX);
// 頂点のコストを記録する配列
vector<int> d(MAX, INFTY);
// 頂点の状態を記録する配列
vector<int> color(MAX, WHITE);

void dijkstra()
{
  // コストが小さいものを優先する優先度付きキュー
  // 第1成分は辺の重み*(-1)、第2成分は頂点番号
  priority_queue<pair<int, int> > PQ;
  // 初期化
  d.at(0) = 0;
  PQ.push(make_pair(0, 0));
  while (!PQ.empty())
  {
    pair<int, int> f = PQ.top();
    int v = f.second;
    PQ.pop();
    color.at(v) = BLACK;

    // 「余り物」の要素は無視する
    if (d.at(v) < f.first * (-1))
    {
      continue;
    }

    // vに隣接するV-Sの頂点uのdを更新する
    for (int i = 0; i < G.at(v).size(); i++)
    {
      int u = G.at(v).at(i).first;
      // 辺(v,u)の重み
      int cost = G.at(v).at(i).second;
      if (color.at(u) == WHITE)
      {
        // uがV-Sの頂点のとき
        if (d.at(v) + cost < d.at(u))
        {
          // uのdを更新する必要があるとき
          d.at(u) = d.at(v) + cost;
          PQ.push(make_pair(d.at(u) * (-1), u));
        }
      }
    }
  }
}

int main()
{
  cin >> n;
  for (int i = 0; i < n; i++)
  {
    int u, m;
    cin >> u >> m;
    for (int j = 0; j < m; j++)
    {
      int v, cost;
      cin >> v >> cost;
      G.at(u).push_back(make_pair(v, cost));
    }
  }

  dijkstra();

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

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

enum Color{WHITE, GRAY, BLACK};
struct edge{
        int v,c;
        edge(int v, int c): v(v), c(c){}
};
bool operator< (const edge &e, const edge &f){return e.c<f.c;}

int n;
vector<vector<edge>> a;
int *r;

void dijkstra(){
        Color color[n];
        for(int i=0;i<n;i++) color[i]=WHITE;
        color[0] = GRAY;
        priority_queue<edge> pq;
        pq.push(edge(0,0));
        while(!pq.empty()){
                edge e = pq.top(); pq.pop();
                if(color[e.v]==BLACK) continue;
                color[e.v] = BLACK;
                r[e.v] = - e.c;

                for(int i=0;i<a[e.v].size();i++){
                        edge f = a[e.v][i];
                        if(color[f.v]==BLACK) continue;
                        color[f.v] = GRAY;
                        int cost = e.c - f.c;
                        pq.push(edge(f.v, cost));
                }
        }

}

int main(){
        int u,k,v,c;
        cin>>n;
        a = vector<vector<edge>>(n);
        r = new int [n];
        for(int i=0;i<n;i++){
                cin>>u>>k;
                for(int j=0;j<k;j++){
                        cin>>v>>c;
                        a[u].emplace_back(edge(v,c));
                }
        }

        dijkstra();

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

C++: #include<bits/stdc++.h>
using namespace std;
inline int in()
{
    char c=getchar();
    while(!isdigit(c))c=getchar();
    int x=0;
    while(isdigit(c))
    {
        x=x*10+c-'0';
        c=getchar();
    }
    return x;
}

typedef pair<int,int>pii; //<distance,point>
const int MAX=10000+5;
struct edge
{
    int v;
    int w;
};
vector<edge>e[MAX];
int dis[MAX];
void dijkstra(const int p)
{
    memset(dis,0x3f,sizeof(dis));
    dis[p]=0;
    priority_queue<pii,vector<pii>,greater<pii> >q;
    q.push(make_pair(0,p));
    while(!q.empty())
    {
        pii P=q.top();
        q.pop();
        const int now=P.second;
        if(dis[now]<P.first)continue;
        const int len=e[now].size();
        for(int i=0;i<len;i++)
        {
             edge const * const j=&e[now][i];
            if(dis[j->v]>dis[now]+j->w)
            {
                dis[j->v]=dis[now]+j->w;
                q.push(make_pair(dis[j->v],j->v));
            }
        }
    }
}
int main()
{
    int n=in();
    for(int i=0;i<n;i++)
    {
        const int u=in(),k=in();
        for(int j=0;j<k;j++)
        {
            edge E;
            E.v=in();E.w=in();
            e[u].push_back(E);
        }
    }
    dijkstra(0);
    for(int i=0;i<n;i++)printf("%d %d\n",i,dis[i]);
}

C++: #include <iostream>
#include <cstdlib>
#include <string>
#include <typeinfo>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;
static const int INFTY = (1<<20);
static const int MAX =10000;

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

void dijkstra(){
    priority_queue<pair<int, int> > PQ;
    int d[MAX], color[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,c,u,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;
}