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
}

type Neighbor struct {
	node   int
	weight 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) ([][]Neighbor, error) {
	adjacentMatrix := make([][]Neighbor, n)
	for i := 0; i < n; i++ {
		id, err := nextInt(sc)
		if err != nil {
			return nil, err
		}
		adjacentMatrix[id] = []Neighbor{}
		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] = append(adjacentMatrix[id], Neighbor{v, c})
		}
	}
	return adjacentMatrix, nil
}

func sssp(nodeStack []int, shortestList []ShortestInfo, adjacentMatrix [][]Neighbor) {
	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 [][]Neighbor) []Edge {
	adjacents := adjacentMatrix[currentNode]
	edges := []Edge{}
	for _, neighbor := range adjacents {
		edges = append(edges, Edge{start: currentNode, end: neighbor.node, weight: neighbor.weight})
	}
	return edges
}

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

C++: #include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ll;

#define EPS (1e-7)
#define INF (1<<20)
#define PI (acos(-1))
#define MAX 10000
#define WHITE  0
#define GRAY  1
#define BLACK  2

int N;
vector< pair<int, int> > G[MAX]; // targetの先と、重みのペアが保存されている

void dijkstra(int s) { // sはスタート地点
    priority_queue<pair <int, int> > PQ;
    int color[MAX];
    int d[MAX]; // 最短距離を保存する

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

    d[0] = 0;
    PQ.push(make_pair(0, 0)); // d, vの順で入っている
    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< G[u].size(); j++) {
            int v =  G[u][j].first; //　隣接する頂点の取り出し
            if ( color[v] == BLACK) continue;
            if ( d[v] > d[u] + G[u][j].second ) {
                d[v] = d[u] + G[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] == INF ? -1 : 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;
            G[u].push_back(make_pair(v, c));
        }
    }

    dijkstra(0);
    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(void);

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;
}

void dijkstra(void)
{
  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;
    }
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
const int maxx=10010;
const int infinity=1<<30;

int main() {
	int n,a,b,c,e;
	vector<pair<int, int> > A[maxx];
	bool flag[maxx];
	int d[maxx];
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a>>b;
		for(int j=0;j<b;j++){
			cin>>c>>e;
			A[a].push_back(make_pair(c,e));
		}
	}
	for(int i=0;i<n;i++){
		flag[i]=false;
		d[i]=infinity;
	}
	priority_queue<pair<int,int> > PQ;
	d[0]=0;
	PQ.push(make_pair(0, 0));
	while(PQ.empty()==0){
		pair<int, int> u=PQ.top();
		PQ.pop();
		//cout<<u.first<<" "<<d[u.first]<<endl;
		flag[u.second]=true;
		int len=A[u.second].size();
		for(int i=0;i<len;i++){
			int v=A[u.second][i].first;
			if(flag[v]==false && d[u.second]+A[u.second][i].second<d[v]){
				d[v]=d[u.second]+A[u.second][i].second;
				PQ.push(make_pair(d[v]*(-1),v));
			}
		}
	}

	for(int i=0;i<n;i++) cout<<i<<" "<<(d[i]==infinity ? -1 : d[i])<<endl;

	return 0;
}