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++: //Single Source Shortest Path II
#include <iostream>
#include <vector>
#include <queue>
#include <climits>

using namespace std;

static const int N = 10000;
static const int WHITE = 0;
static const int BLACK = 1;
int d[N];

void dijkstra(vector<vector<pair<int, int>>> G, int n) {
    int colors[n];
    for(int i = 0; i < n; i++) {
        colors[i] = WHITE;
        d[i] = INT_MAX;
    }

    priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq;

    d[0] = 0;
    pq.push(make_pair(0, 0));
    while(!pq.empty()) {
        pair<int, int> f = pq.top();
        pq.pop();
        
        int u = f.second;
        if(d[u] < f.first) continue;
        if(colors[u] == BLACK) continue;
        for(int i = 0; i < G[u].size(); i++) {
            if(d[G[u][i].first] > f.first + G[u][i].second) {
                d[G[u][i].first] = f.first + G[u][i].second;
                pq.push(make_pair(d[G[u][i].first], G[u][i].first));
            }

        }
    }
}

int main() {
    int n, u, k, v, c;
    cin >> n;
    vector<vector<pair<int, int>>> G(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(G, n);

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

    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
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;
                // priority_queue はデフォルトで大きい値を優先するため -1 を掛ける
                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<cstdio>
#include<climits>
using namespace std;
  
#define N 10001
int n;
  
int g[N][N];
  
int weight[N];
bool us[N];
  
//prim
void prim(){
  
  int v;
   
  weight[0]=0;
    
  while(true){
    v=-1;
     
    for(int i=0;i<n;i++){
      if(us[i]!=true && (v==-1 ||weight[i]<weight[v]))v=i;
    }
  
    if(v==-1)break;
    us[v]=true;
   
  
    for(int i=0;i<n;i++){
      if(weight[i]>(g[v][i]+weight[v])){
  
        weight[i]=(g[v][i]+weight[v]);
        //      cout <<"fsafa"<<endl;
      }
    }
  }
   
}
  
  
int main(){
  
  int u,k1,c,v;
  
  for(int i=0;i<N;i++){
    for(int j=0;j<N;j++){
      g[i][j]=9953535;
    }
  }
  
  //load n
  cin >>n;
  
  //load data
  for(int i=0;i<n;i++){
    weight[i]=INT_MAX;
    us[i]=false;
    scanf("%d %d",&u,&k1);
    for(int j=0;j<k1;j++){
      scanf("%d %d",&v,&c);
      g[u][v]=c;
      //    cout <<g[i][j]<<" ";
    }
    //    cout <<endl;
  }
  
  
  
  
  //print
  prim();
  
  for(int i=0;i<n;i++){
    cout <<i<<" "<<weight[i]<<endl;
  }
delete g;
  return 0;
  
}

C++: #include <iostream>
// #include <vector> 
#include <algorithm>
#include <queue>
#include <cstdio> 
using namespace std;
static const int MAX = 10000;
static const int INFTY = (1<<20);
int d[MAX],color[MAX];
int n;
vector<pair<int, int> > adj[MAX];

void dijkstra()
{
    priority_queue<pair<int, int> > PQ;
    for (int i = 0; i < n; i++)
    {
        d[i] = INFTY;
        color[i] = 0;
    } 
    d[0] = 0;
    PQ.push(make_pair(0,0));
    color[0] = 1;
    while (!PQ.empty())
    { 
        pair<int, int> f = PQ.top(); PQ.pop();
        int u = f.second;
        // cout<<u<<" "<<color[u]<<endl;
        color[u] = 2;
        
        //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] == 2) continue;
            if (color[v] != 2 && 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] = 1;
            } 
        } 
    } 

    return;
}


int main()
{
    //freopen("in3.txt","r",stdin);
    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(v,c));
        } 
    } 
    dijkstra();
    for (int i = 0; i < n; i++)
    {
        cout<<i<<" "<<d[i]<<endl; 
    } 
    return 0;
}