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 <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
const int MAX_N =10010;
int d[MAX_N];//最短距離
struct edge{
	int from,to,cost;
	edge(int _from,int _to,int _cost){
		from =_from;
		to =_to;
		cost =_cost;
	}
};
vector<edge> es;//辺
int V,E;//頂点数と変数

void bellman(int s){
	for(int i =0;i <V;i++)d[i]=INF;
	d[s] = 0;
	while(true){
		bool update=false;
		for(int i =0;i <E;i++){
			edge e =es[i];
			if(d[e.from]!=INF&&d[e.to] >d[e.from] +e.cost){
				d[e.to] =d[e.from]+e.cost;
				update =true;
			}
		}
		if(!update)break;
	}
}
int main(){
	cin>>V;
	E = 0;
	for(int i =0;i < V;i++){
		int node,k;
		cin>>node>>k;
		for(int j =0;j <k;j++){
			int x,c;
			cin>>x>>c;
			es.push_back(edge(node,x,c));
			E++;
		}
	}
	bellman(0);
	for(int i=0;i < V;i++){
		cout <<i<<" "<<d[i]<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
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];
  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 <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(n) begin(n), end(n)
using ll = long long;
using namespace std;

const int INF = 1001001001;

int main(){
  int n;
  cin >> n;
  vector<vector<pair<int, int>>> gr(n, vector<pair<int, int>>());
  rep(i, n){
    int a;
    cin >> a;
    int k;
    cin >> k;
    rep(j, k){
      int v, c;
      cin >> v >> c;
      gr.at(i).push_back(make_pair(v, c));
    }
  }
  vector<bool> chk(n, false);
  vector<int> d(n, INF);
  priority_queue<pair<int, int>> q;
  q.push(make_pair(0, 0));
  int co = 0;
  while(!q.empty()){
    auto now = q.top(); q.pop();
    if(chk.at(now.second) == true) continue;
    d.at(now.second) = -1 * now.first;
    chk.at(now.second) = true;
    co++;
    if(co == n) break;

    for(auto p : gr.at(now.second)){
      if(chk.at(p.first) == true) continue;
      q.push(make_pair(now.first-p.second, p.first));
    }
  }

  rep(i, n){
    cout << i << " " << d.at(i) << endl;
  }
  return 0;
}

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

typedef struct{
  int A[10010];
  int ans;
}node;
node T[10010];
int Q[1000003];
int head=0;
int tail=1;
int n;

void function(int num){
  while(true){
    if(head==tail)break;
    num=Q[head++];
        if(head==999999)head=1;
    for(int i=0;i<n;i++){
      if(T[num].A[i]!=-1){
	if(T[i].ans>T[num].ans+T[num].A[i]){
	  T[i].ans=T[num].ans+T[num].A[i];
	  Q[tail++]=i;
	  	  if(tail==999999)tail=1;
	}
      }
    }
  }
}

int main(){
  int num,son,z,w;
  cin>>n;
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      T[i].A[j]=-1;
    }
  }


  for(int i=0;i<n;i++){
    cin>>num>>son;
    T[num].ans=INT_MAX;
    for(int j=0;j<son;j++){
      cin>>z>>w;
      T[num].A[z]=w;
      }
  }
  Q[0]=0;
  T[0].ans=0;
  function(0);
 
  for(int i=0;i<n;i++){
      cout<<i<<" "<<T[i].ans<<endl;
  }
  return 0;
}

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

#define INF 2000000000

struct edge{ int to, cost;};
struct P{ int d, to;};

int n;
int sz = 0; //heap size
P heap[20000];
vector<edge> G[10000]; //adjacency list
int d[10000];

//minimum heap
void push(P x){
  
  int i = sz++;
  
  while(i > 0){
    int p = (i - 1) / 2;
    
    if(heap[p].d <= x.d) break;
    
    heap[i] = heap[p];
    i = p;
  }
  
  heap[i] = x;
}

P pop(){
  
  P ret = heap[0];
  P x = heap[--sz];
  
  int i = 0;
  while(i * 2 + 1 < sz){
    
    int a = i * 2 + 1, b = i * 2 + 2;
    if(b < sz && heap[b].d < heap[a].d) a = b;
    
    if(heap[a].d >= x.d) break;
    
    heap[i] = heap[a];
    i = a;
  }
  
  heap[i] = x;
  
  return ret;
}

void dijkstra(int s){

  //initialization
  for(int i = 0;i < n;i++) d[i] = INF;
  d[s] = 0;
  push((P){0, s});
  
  while(sz){
    P p = pop();
    int v = p.to;
    
    if(d[v] < p.d) continue;
    for(int i = 0;i < (int)G[v].size();i++){
      edge e = G[v][i];
      if(d[e.to] > d[v] + e.cost){
        d[e.to] = d[v] + e.cost;
        push((P){d[e.to], e.to});
      }
    }
  }
}

int main(){
  
  int u, k;
  edge e;

  //input
  cin >> n;
  for(int i = 0;i < n;i++){
    cin >> u >> k;
    for(int j = 0;j < k;j++){
      cin >> e.to >> e.cost;
      G[u].push_back(e);
    }
  }
  
  dijkstra(0);

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