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 <queue>
#include <vector>

using namespace std;

#define MAX_V 10000
#define INF 1e9

struct edge{ int to,cost; };
typedef pair<int,int> P;

int V;
vector<edge> G[MAX_V];
int dist[MAX_V];

void dijkstra(){
  priority_queue<P, vector<P>, greater<P> > Q;
  fill(dist,dist+V,INF);
  dist[0] = 0;
  Q.push(P(0,0));

  while(!Q.empty()){
    P p = Q.top(); Q.pop();
    int v = p.second;

    if(dist[v] < p.first){
      continue;
    }

    for(int i = 0 ; i < (int)G[v].size() ; i++){
      edge e = G[v][i];
      
      if(dist[e.to] > dist[v] + e.cost){
	dist[e.to] = dist[v] + e.cost;
	Q.push(P(dist[e.to],e.to));
      }
    }

  }
}

int main(){
  cin >> V;
 
  for(int i = 0 ; i < V ; i++){
    int u,k;

    cin >> u >> k;
    for(int j = 0 ; j < k ; j++){
      int v,c;

      cin >> v >> c;

      edge e = {v,c};
      G[u].push_back(e);
    }
  }

  dijkstra();
  for(int i = 0 ; i < V ; i++){
    cout << i << " " << dist[i] << endl;
  }

  return 0;
}

C++: #include<iostream>
#include<cstdio>
#define INF 1<<30
#define FinishFunction return 0
#define MAX 1000000
using namespace std;
     
struct edge {
  int from,to,cost,k;
};
   
edge es[MAX];
   
int main(){
  int n,u,k,E,c,v;
  E = 0;
  scanf("%d",&n);
   
  for(int i=0;i<n;i++){
    scanf("%d %d",&u,&k);
      
    for(int j=0;j<k;j++){
      scanf("%d %d",&v,&c);
      es[E].from = u;
      es[E].to = v;
      es[E++].cost = c;
    }
  }
   
  // Ika berumanfo-do  
  int d[MAX];
  for(int i=0;i<n;i++)d[i] = INF;
  d[0] = 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;
  }
  for(int i=0;i<n;i++)cout << i << " " << d[i] << endl;
  FinishFunction;// return 0
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<list>
#include<string>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
using namespace std;

const int NIL = -1;
const int MAX = 1 << 21;

int color[10001], d[10001];

struct Node {
	int node, weight;
};
vector<Node>M[10001];

struct cmp {
	bool operator () (Node a, Node b)
	{
		return a.weight > b.weight;
	}
};

int next(int u) {
	for (int i = 0; i < M[u].size(); i++) {
		if (color[M[u][i].node] == 0) {
			color[M[u][i].node] = 1;
			return i;
		}
	}
	return -1;
}

int main(void)
{
	int n, u, k, v, c;
	priority_queue<Node, vector<Node>, cmp>PQ;
	Node s;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> u >> k;
		for (int j = 0; j < k; j++) {
			cin >> v >> c;
			s.node = v;
			s.weight = c;
			M[u].push_back(s);
		}
	}
	for (int i = 0; i < n; i++) {
		color[i] = 0;
		d[i] = MAX;
	}
	d[0] = 0;
	s.node = s.weight = 0;
	PQ.push(s);
	while (!PQ.empty()) {
		Node u = PQ.top();
		PQ.pop();
		color[u.node] = 2;
		for (int i = 0; i < n; i++) {
			if (color[i] != 2)
				color[i] = 0;
		}
		if (d[u.node] < u.weight)
			continue;
		while ((v = next(u.node)) != NIL) {
			int tmp = M[u.node][v].node;
			if (color[tmp] != 2) {
				if (d[u.node] + M[u.node][v].weight < d[tmp]) {
					d[tmp] = M[u.node][v].weight + d[u.node];
					s.node = tmp;
					s.weight = d[tmp];
					PQ.push(s);
				}
			}
		}
	}
	for (int i = 0; i < n; i++) {
		cout << i << " " << d[i] << endl;
	}
	return 0;
}

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

typedef long long ll;

struct Edge {
    ll t,w;
};

struct State {
    ll v;
    ll score;
    bool operator < (const State& tgt) const {
	return score > tgt.score;
    }
};

vector<ll> dijkstra(vector<vector<Edge>>& G, const int start) {
    const ll V = G.size();

    vector<ll>res(V,INT_MAX);
    priority_queue<State> q;
    q.push( State{0,0} );
    while( q.size() ) {
	State s = q.top(); q.pop();
	if( res[s.v] != INT_MAX ) continue;
	res[s.v] = s.score;
	for(auto& e : G[s.v]) {
	    if( res[e.t] != INT_MAX ) continue;
	    q.push( State{e.t, s.score + e.w} );
	}
    }
    return res;
}


int main () {

    ll V; cin >> V;
    vector<vector<Edge>> G(V);
    for(int i=0; i<V; i++) {
	ll u,k; cin >> u >> k;
	for(int j=0; j<k; j++) {
	    ll v,w; cin >> v >> w;
	    G[i].push_back( Edge{v,w} );
	}
    }
    vector<ll> res = dijkstra(G,0);
    for(int i=0; i<V; i++) {
	cout << i << " " << res[i] << endl;
    }    
    return 0;
}