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 <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
const int maxx = 10010;
const int INF = 1 << 30;
int n;
int flag[maxx];
// ???????????????????????\??¨??¨?????????pair.first?????¶???v???pair.second?????????
vector<pair<int, int> > adj[maxx];

void dijkstra() {
	priority_queue<pair<int, int> > PQ;
	int d[maxx];
	for (int i = 0; i < n; i++) {
		d[i] = INF;
		flag[i] = 0;
	}

	d[0] = 0;
	PQ.push(make_pair(0, 0));
	while (!PQ.empty()) {

		pair<int, int> f = PQ.top(); PQ.pop();
		int u = f.second;

		// ?????°???????????\S
		flag[u] = 1;

		//????????????????°?????????????????????\
		if (d[u] < f.first *(-1))
			continue;
		int len = adj[u].size();
		for (int j = 0; j < len; j++) {
			int v = adj[u][j].first;
			if (flag[v] == 0 && 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));
			}
		}
	}

	for (int i = 0; i < n; i++)
		printf("%d %d\n", i, d[i] == INF ? -1 : d[i]);
}
int main()
{
	int u, v, k, c;
	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);
			adj[u].push_back(make_pair(v, c));
		}
	}
	dijkstra();
	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 <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef vector <int> vi;
typedef vector <vi> vvi;

class blanch{
	public:
		int weight;
		int from;
		int to;
		blanch():
			weight(0), from(0), to(0){};
		blanch(int newweight, int newfrom, int newto):
			weight(newweight), from(newfrom), to(newto){};
};
typedef vector <blanch> vb;


bool operator<( const blanch &blanch1, const blanch &blanch2){
	return (blanch1.weight > blanch2.weight);
	}

bool operator>( const blanch &blanch1, const blanch &blanch2){
	return (blanch1.weight < blanch2.weight);
	}

int make_graph(vvi &graph, vi &stamp){
	int n=graph.size();
	for (int i=0; i<n; i++){
		for (int j=0; j<n; j++){
			graph[i][j]=-1;
		}
	}

	for (int i=0; i<n; i++){
		int i2,n2;
		cin>>i2;
		cin>>n2;
		for (int j=0; j<n2; j++){
			int j2;
			cin>>j2;
			cin>>graph[i2][j2];
		}
		stamp[i] = -1;
	}
	return 0;
}

int Shortest_Path(vvi &graph, vi &stamp){

	priority_queue<blanch, vb, less<vb::value_type> > pq;
	int n = graph.size(), p1=0;
	stamp[p1] = 0;

	while (p1 != -1){
		for (int p2 = 0; p2 < n; p2++){
			int *tmp = &graph[p1][p2];
			if (*tmp!=-1 && stamp[p2]==-1){
				pq.push(blanch(*tmp + stamp[p1], p1, p2));
			}
		}
		p1 = -1;
		while (! pq.empty()){
			blanch tmp = pq.top();
			if (stamp[tmp.from]!=-1 && stamp[tmp.to]==-1){
				p1 = tmp.to;
				stamp[p1] = tmp.weight;
				pq.pop();
				break;
			} else
				pq.pop();
		}
	}
	return 0;
}

int resultout(vi &stamp){
	int n = stamp.size();
	for (int i=0; i<n; i++){
		cout<<i<<" "<<stamp[i]<<endl;
	}
	return 0;
}

int main(void){

	int n;
	cin>>n;
	vvi G(n, vi(n));
	vi stamp(n);

	make_graph(G, stamp);

	Shortest_Path(G, stamp);

	resultout(stamp);

	return 0;
}