Go: package main

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

const NIL = -1

type Node struct {
	id     int
	weight int
}

func init() {
	sc.Split(bufio.ScanWords)
}

type NodeHeap []Node

func (h NodeHeap) Len() int           { return len(h) }
func (h NodeHeap) Less(i, j int) bool { return h[i].weight < h[j].weight }
func (h NodeHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *NodeHeap) Push(x interface{}) {
	*h = append(*h, x.(Node))
}

func (h *NodeHeap) Pop() interface{} {
	old := *h
	n := len(old)
	x := old[n-1]
	*h = old[0 : n-1]
	return x
}

var sc = bufio.NewScanner(os.Stdin)

func scanInt() int {
	num, _ := strconv.Atoi(scanString())
	return num
}

func scanString() string {
	sc.Scan()
	return sc.Text()
}

func init() {
	sc.Split(bufio.ScanWords)
}

func main() {
	n := scanInt()

	route := make([][]Node, n)
	weight := make([]int, n)
	for i := 0; i < n; i++ {
		weight[i] = NIL
	}

	for i := 0; i < n; i++ {
		u := scanInt()
		k := scanInt()
		route[i] = make([]Node, k)
		for j := 0; j < k; j++ {
			route[u][j] = Node{id: scanInt(), weight: scanInt()}
		}
	}

	start := Node{id: 0, weight: 0}
	h := &NodeHeap{start}
	heap.Init(h)

	for h.Len() > 0 {
		node := heap.Pop(h).(Node)
		if weight[node.id] != NIL {
			continue
		}
		weight[node.id] = node.weight

		for _, nextNode := range route[node.id] {
			if weight[nextNode.id] != NIL {
				continue
			}
			nextNode.weight += node.weight
			heap.Push(h, nextNode)
		}
	}

	for i, w := range weight {
		fmt.Println(i, w)
	}
}

C++: #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
const long long INFLL = 1LL << 60;
const int INFINT = 1 << 30;
const long long MOD = 1e9 + 7;

template <class T> void vecout(T V) {
    auto t = V.begin();
    while(t != V.end()) {
        cout << " " << *t++;
        // if(t != V.end()) cout << " ";
    }
    cout << endl;
};

struct edge {
    int t;
    int c;
    edge(int a, int b) {
        t = a;
        c = b;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, u, k, v, c;
    cin >> n;
    vector<edge> E[n];
    rep(i, n) {
        cin >> u >> k;
        rep(j, k) {
            cin >> v >> c;
            edge tmp(v, c);
            E[u].push_back(tmp);
        }
    }

    priority_queue<pair<int, int>, vector<pair<int, int>>,
                   greater<pair<int, int>>>
        Q; // cost,V

    int d[n];
    fill(d, d + n, INFINT);
    Q.push(make_pair(0, 0));

    int fix = 0;
    while(fix < n && !Q.empty()) {
        pair<int, int> v = Q.top();
        Q.pop();
        if(d[v.second] != INFINT) continue;
        d[v.second] = v.first;
        fix++;
        for(auto e : E[v.second]) {
            if(d[e.t] == INFINT) {
                Q.push(make_pair(v.first + e.c, e.t));
            }
        }
    }

    rep(i, n) cout << i << " " << d[i] << "\n";
}

C++: #include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int, long> P;
typedef struct edge{ long cost; int to; }edge;

const long INF = 1e11;

int main(){
  int n; cin >> n;
  long d[n];
  vector<edge> G[n];
  for(int i=0; i<n; i++){
    d[i] = INF;
    int u, k; cin >> u >> k;
    int v, c;
    for(int j=0; j<k; j++){
      cin >> v >> c;
      edge e; e.to = v; e.cost = c;
      G[u].push_back(e);
    }
  }
  priority_queue<P, vector<P>, greater<P>> que;
  d[0] = 0;
  que.push(P(0, 0));
  while(!que.empty()){
    P v = que.top(); que.pop();
    if(d[v.second] < v.first) continue;
    for(int i=0; i<G[v.second].size(); i++){
      edge e = G[v.second][i];
      if(d[e.to] > d[v.second] + e.cost){
        d[e.to] = d[v.second] + e.cost;
        que.push(P(d[e.to], e.to));
      }
    }
  }
  for(int i=0; i<n; i++){
    cout << i << " " << d[i] << endl;
  }
}

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

    dijkstra();

    return 0;
}

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

static const int MAX = 10000;
static const int INF = (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(){
    int color[MAX], d[MAX];

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

    d[0] = 0;

    // pair<vに到達するまでのスコア、v>
    priority_queue<pair<int,int>> pq;
    pq.push({0,0});
    color[0] = GRAY;

    while(!pq.empty()){
        pair<int,int> p = pq.top(); pq.pop();
        int u = p.second;
        
        color[u] = BLACK;
        if(d[u] < p.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({d[v]*(-1), v});
                color[v] = GRAY;
            }
        }
    }

    for(int i = 0; i < n; i++){
        cout << i << " " << 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;
           adj[u].push_back({v,c});
       }
   }

   dijkstra();

   return 0;
}

C++: #include <iostream>
#include <fstream>
#include <stdio.h>
#include <algorithm>
#include <queue>

using namespace std;

static const int MAX = 1000000;
static const int INFTY = (1 << 21);

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

void dijkstr(){
    int d[MAX];
    priority_queue<pair<int, int>,vector<pair<int, int> >, greater<pair<int, int> > > pq;
    fill(d, d+n, INFTY);
    
    pq.push(make_pair(0, 0));
    
    while(!pq.empty()){
        pair<int, int> f = pq.top(); pq.pop();
        int u = f.second;
        if(d[u] != INFTY) continue;
        d[u] = f.first;
        for(int i=0; i<M[u].size(); i++){
            pq.push(make_pair(f.first+M[u][i].first, M[u][i].second));
        }
    }
    
    for(int i=0; i<n; i++)
        cout << i << " " << d[i] << endl;
    
}


int main(int argc, const char * argv[]) {
    // input from txt
    /////////
    //write//
    /////////
    
    cin >> n;
    int u, k ,v, c;
    
    for(int i=0; i<n; i++){
        cin >> u >> k;
        for(int j=0; j<k; j++){
            cin >> v >> c;
            M[u].push_back(make_pair(c, v));
        }
    }
    
    dijkstr();
    
    return 0;
}