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<iostream>
#include<algorithm>
#include<queue>
using namespace std;
#define maxn 10010
#define INFTY (1<<30)
#define WHITE 0
#define GRAY 1
#define BLACK 2

int n;
vector<pair<int,int> > adj[maxn]; //加权有向图的邻接表表示法

void dijkstra(int s)
{
    priority_queue<pair<int,int> > PQ;
    int color[maxn],d[maxn],p[maxn]; //p数组可以不要
    for(int i=0;i<n;i++)
    {
        color[i]=WHITE;
        d[i]=INFTY;
        p[i]=-1;
    }
    d[s]=0;
    PQ.push(make_pair(s,0));
    color[s]=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[u]+adj[u][j].second<d[v])
            {
                d[v]=d[u]+adj[u][j].second;
                //优先级队列默认优先最大值，所以要乘以-1
                PQ.push(make_pair(d[v]*(-1),v));
                p[v]=u;
                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(0);
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <utility>
#include <functional>
#include <numeric>
#include <limits>

template <class T>
using vec = std::vector<T>;

constexpr int nil = -1;
constexpr int inf = std::numeric_limits<int>::max();

struct Edge
{
    int to;
    int cost;

    bool operator<(const Edge& rhs) const
    {
        return cost < rhs.cost;
    }

    bool operator>(const Edge& rhs) const
    {
        return cost > rhs.cost;
    }
};



vec<int> dijkstra(const vec<vec<Edge>>& edges)
{
    using namespace std;

    const int n = edges.size();
    vec<int> distances(n, inf);
    vec<bool> reached(n, false);
    priority_queue<Edge, vector<Edge>, greater<Edge>> pqDist;

    pqDist.push({0, 0});

    while (true)
    {
        //始点からの最短点、コスト
        Edge d {nil, inf};

        //一番近い点を探す
        while (!pqDist.empty())
        {
            auto e = pqDist.top();
            pqDist.pop();

            if (!reached[e.to])
            {
                d = e;
                break;
            }
        }

        if (d.cost == inf)
            break;

        reached[d.to] = true;
        distances[d.to] = d.cost;

        for (auto& e : edges[d.to])
        {
            pqDist.push({e.to, d.cost + e.cost});
        }
    }

    return distances;
}

void solve()
{
    using namespace std;
    int n;
    cin >> n;

    //隣接リスト形式
    vec<vec<Edge>> edges(n);

    //入力
    for (int i = 0; i < n; ++i)
    {
        int v, k;
        cin >> v >> k;
        for (int j = 0; j < k; ++j)
        {
            int to, cost;
            cin >> to >> cost;
            edges[i].push_back({to, cost});
        }
    }

    auto d = dijkstra(edges);

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

int main()
{
    solve();
    return 0;
}

C++: #include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
#define MAX 10000
#define INFTY 10000000
#define DEFLT 0
#define WHITE 0
#define GRAY 1
#define BLACK 2

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

void dijkstra(){
  int u, v, d[MAX], color[MAX];
  priority_queue<pair<int, int> > PQ; // uからvへの重みcとuに隣接する頂点の番号vのペア: pair<c, v*(-1)>

  for(int i=0; i<n; i++){
    color[i] = WHITE;
    d[i] = INFTY;
  }
  d[DEFLT] = 0;
  color[0] = GRAY;

  PQ.push(make_pair(0, DEFLT));

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

    for(int i=0; i<adj[u].size(); i++){
      v = adj[u][i].second;
      if(color[v] != BLACK && d[u] + adj[u][i].first < d[v]){
        //cout << "u=" << u << ", v=" << v << ", d[u]=" << d[u] << ", d[v]=" << d[v] << "adj[u][i].first=" << adj[u][i].first << endl;
        d[v] = d[u] + adj[u][i].first;
        color[v] = GRAY;
        PQ.push(make_pair(d[v] * (-1), v));
      }
    }
  }

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

int main(void){
  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;
      adj[u].push_back(make_pair(c, v));
    }
  }

  dijkstra();
  return 0;
}

C++: #include <bits/stdc++.h>
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], d[MAX];
    for (int i = 0; i < n; i++) {
        d[i] = INFTY;
        color[i] = WHITE;
    }

    // 0 start
    d[0] = 0;
    PQ.push(make_pair(0, 0));
    color[0] = GRAY;

    while (!PQ.empty()) {
        // choose u
        pair<int, int> f = PQ.top(); // cost, node
        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));  // node_id, cost
        }
    }

    dijkstra();
}