Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

const (
	MAX_N      = 10000
	MAX_WEIGHT = 100000
)

type Edge struct {
	start  int
	end    int
	weight int
}

type ShortestInfo struct {
	edges    []Edge
	shortest int
}

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

	n, err := nextInt(sc)
	if err != nil {
		panic(err)
	}

	shortestList := make([]ShortestInfo, n)
	for i := 1; i < n; i++ {
		shortestList[i] = ShortestInfo{edges: []Edge{}, shortest: MAX_N*MAX_WEIGHT + 1}
	}

	adjacentMatrix, err := createAdjacentMatrix(n, sc)
	if err != nil {
		panic(err)
	}

	sssp([]int{0}, shortestList, adjacentMatrix)
	for _, v := range shortestList {
		fmt.Printf("%d %d\n", v.getEnd(), v.shortest)
	}
}

func (si ShortestInfo) getEnd() int {
	if len(si.edges) == 0 {
		return 0
	} else {
		return si.edges[len(si.edges)-1].end
	}
}

func createAdjacentMatrix(n int, sc *bufio.Scanner) ([][]int, error) {
	adjacentMatrix := make([][]int, n)
	for i := 0; i < n; i++ {
		id, err := nextInt(sc)
		if err != nil {
			return nil, err
		}
		adjacentMatrix[id] = make([]int, n)
		for j := 0; j < n; j++ {
			adjacentMatrix[id][j] = -1
		}
		vertexNum, err := nextInt(sc)
		if err != nil {
			return nil, err
		}
		for j := 0; j < vertexNum; j++ {
			v, err := nextInt(sc)
			if err != nil {
				return nil, err
			}
			c, err := nextInt(sc)
			if err != nil {
				return nil, err
			}
			adjacentMatrix[id][v] = c
		}
	}
	return adjacentMatrix, nil
}

func sssp(nodeStack []int, shortestList []ShortestInfo, adjacentMatrix [][]int) {
	for len(nodeStack) > 0 {
		currentNode := nodeStack[0]
		nodeStack = nodeStack[1:]
		currentShortest := getShortest(currentNode, shortestList)
		adjacents := findAdjacents(currentNode, adjacentMatrix)
		for i := 0; i < len(adjacents); i++ {
			adj := adjacents[i]
			if currentShortest.shortest+adj.weight < getShortest(adj.end, shortestList).shortest {
				setShortest(adj.end, adj, currentShortest, shortestList)
				nodeStack = append(nodeStack, adj.end)
			}
		}
	}
}

func getShortest(node int, shortestList []ShortestInfo) ShortestInfo {
	return shortestList[node]
}

func setShortest(node int, edge Edge, currentShortest ShortestInfo, shortestList []ShortestInfo) {
	newEdges := make([]Edge, len(currentShortest.edges)+1)
	for i := 0; i < len(newEdges)-1; i++ {
		newEdges[i] = currentShortest.edges[i]
	}
	newEdges[len(newEdges)-1] = edge
	shortestInfo := ShortestInfo{edges: newEdges, shortest: currentShortest.shortest + edge.weight}
	shortestList[node] = shortestInfo
}

func findAdjacents(currentNode int, adjacentMatrix [][]int) []Edge {
	adjacents := adjacentMatrix[currentNode]
	edges := []Edge{}
	for i, v := range adjacents {
		if v >= 0 {
			edges = append(edges, Edge{start: currentNode, end: i, weight: v})
		}
	}
	return edges
}

func nextInt(sc *bufio.Scanner) (int, error) {
	sc.Scan()
	return strconv.Atoi(sc.Text())
}

C++: #include<bits/stdc++.h>
using namespace std;

const int MAX = 10010;
const int INF = INT_MAX;

int n;
int dist[MAX];
typedef pair<int, int> VC;
typedef pair<int, int> VD;
vector< vector<VC> > G;

void dijkstra(int s)
{
  priority_queue<VD, vector<VD>, function<bool(VD, VD)>> que(
    [](VD a, VD b) { return a.second >= b.second; }
  );

  dist[s] = 0;
  que.push(make_pair(s, dist[s]));
  while (!que.empty()) {
    VD vd= que.top(); que.pop();
    int u = vd.first, d = vd.second;
    for (int i = 0; i < G[u].size(); i++) {
      int v = G[u][i].first, c = G[u][i].second;
      if (dist[v] > d + c) {
        dist[v] = d + c;
        que.push(make_pair(v, dist[v]));
      }
    }
  }
}

int main()
{
  cin >> n;

  fill(dist, dist+n, INF);
  G = vector< vector<VC> >(n);

  for (int i = 0; i < n; i++) {
    int u, k; cin >> u >> k;
    for (int j = 0; j < k; j++) {
      int v, c; cin >> v >> c;
      G[u].push_back(make_pair(v, c));
    }
  }

  dijkstra(0);

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

  return EXIT_SUCCESS;
}

C++: #include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#define P pair<int, int>

using namespace std;
const int MAX = 1<<30;

int main(){
  int n, d[10009];
  vector<P> G[10009];
  queue<int> Q;
  cin >> n;
  for(int i=0;i<n;i++){
    int u, k, v, c;
    cin >>u >> k;
    for(int j=0;j<k;j++){
      cin >> v >> c;
      G[u].push_back(P(v, c));
    }
    d[i] = MAX;
  }
  d[0] = 0;
  Q.push(0);
  while(!Q.empty()){
    int cur = Q.front();Q.pop();
    for(int i=0;i<G[cur].size();i++){
      int next = G[cur][i].first, weight = G[cur][i].second;
      if(weight + d[cur]< d[next]){
        d[next] = weight + d[cur];
        Q.push(next);
      }
    }
  }
  for(int i=0;i<n;i++)cout << i << ' ' << d[i] << endl;
}

C++: //
// Created by yuu on 2019-06-20.
//

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <utility>
#include <math.h>
#include <stack>
#include <queue>
#include <cstdio>

using namespace std;

#define MAX 10010
#define INF 1<<20

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

void dijkstra(int start){
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> PQ;
    int d[MAX];
    int check[MAX];
    for (int i = 0; i < N; ++i) {
        d[i] = INF;
        check[i] = -1;
    }

    d[0] = 0;
    check[0] = 0;
    PQ.push(make_pair(0, start));

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

        //　接続先が小さい
        if (d[u] < f.first)continue;

        for (int i = 0; i < adj[u].size(); ++i) {
            int v = adj[u][i].first;
            if (check[v] == 1)continue;

            if (d[v] > d[u] + adj[u][i].second) {
                d[v] = d[u] + adj[u][i].second;
                PQ.push(make_pair(d[v], v));
                check[v] = 0;
            }
        }

    }

    for (int i = 0; i < N; ++i) {
        cout<<i<<" "<< (d[i] == INF? -1 : d[i])<<endl;
    }
}

int main(void){
    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<cstdio>
#include<string>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
#define INT(x) int x; scanf("%d",&x)
#define INPUT(x) scanf("%d",&x)
#define REP1(x,n) for(int x = 0; x < n; x++)
#define REP2(x,s,e) for(int x = s; x <= e; x++)
#define BR printf("\n")
#define INF 2000000000

class edge{
public:
    int toid;
    int norm;
    int dist;
    edge(int toid,int norm,int dist){
        this -> toid = toid;
        this -> norm = norm;
        this -> dist = dist;
    }
    bool operator < (const edge &E) const {
        return dist < E.dist;
    }
    bool operator > (const edge &E) const {
        return dist > E.dist;
    }
};

vector<edge> V[10000];
int d[10000];
int count_P = 0;
priority_queue<edge,vector<edge>,greater<edge> > PQ;

void Dijksra(int i,int dist,int n){
    PQ.pop();
    d[i] = dist;
    count_P++;
    if(count_P == n) return;
    
    REP1(k,V[i].size()){
        if (d[V[i][k].toid] == INF && V[i][k].dist > dist + V[i][k].norm){
            V[i][k].dist = dist + V[i][k].norm;
            PQ.push(V[i][k]);
        }
    }
    
    while (d[PQ.top().toid] != INF) PQ.pop();
    if (!PQ.empty()) Dijksra(PQ.top().toid,PQ.top().dist,n);
}

int main(){
    INT(N);
    REP1(i,N) d[i] = INF;
    REP1(i,N){
        int from,n;
        scanf("%d %d",&from,&n);
        REP1(j,n){
            int toid,norm;
            scanf("%d %d",&toid,&norm);
            edge E = edge(toid,norm,INF);
            V[i].push_back(E);
        }
    }
    
    PQ.push(edge(0,0,0));
    Dijksra(PQ.top().toid,0,N);
    
    REP1(i,N){
        printf("%d %d\n",i,d[i]);
    }
    
    return 0;
}