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<queue>
using namespace std;
static const int MAX=100000;
static const int INFTY=2000000000;
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 d[MAX],color[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])<<"\n";
}
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>
using namespace std;

const int INF = 1 << 30;
int cnt = 0;

class Vertex{
public:
    int i;
    int d;
};

void createList(int n, Vertex *list, int *record);
void push(Vertex *q, Vertex vertex);
Vertex pop(Vertex *q);
void buildMinHeap(Vertex *a, int i);
void minHeapify(Vertex *a, int i);
void displayAnswer(int *a, int n);

int main() {

    int n;
    cin>>n;
    
    Vertex list[501000];
    int record[10001];
    createList(n, list, record);
    
    //printf("-----");

    Vertex priorityQueue[501000];
    for(int i = record[0]; i < record[1]; i++) {
        push(priorityQueue, list[i]);
    }

    int answer[10001];
    for (int i = 0; i <= 10001; i++) {
        answer[i] = INF;
    }
    
    for (int i = 0; i < n-1;) {
        Vertex min = pop(priorityQueue);
        
        if(answer[ min.i ] == INF) {
            answer[ min.i ] = min.d;
            for(int j = record[min.i]; j < record[min.i+1]; j++) {
                if(list[j].i == 0) continue;
                list[j].d += min.d;
                push(priorityQueue, list[j]);
            }
            i++;
        }
    }
    
    displayAnswer(answer, n);
    return 0;
}

void createList(int n, Vertex *list, int *record) {
    int sumRecord = 0;
    for(int i = 0; i < n; i++) {
        int u, k;
        cin>>u>>k;
        record[i] = sumRecord;
        sumRecord += k;
        for(int j = record[i]; j < sumRecord; j++) {
            int c, v;
            cin>>c>>v;
            list[j].i = c;
            list[j].d = v;
        }
    }
    record[n] = sumRecord;
}

void push(Vertex *q, Vertex vertex) {
    cnt++;
    q[cnt] = vertex;
    buildMinHeap(q, cnt);
}

Vertex pop(Vertex *q) {
    Vertex min = q[1];
    q[1] = q[cnt];
    cnt--;
    minHeapify(q, 1);
    return min;
}

void buildMinHeap(Vertex *list, int i) {
    if (i >= 1 && list[i].d < list[i/2].d) {
        Vertex tmp = list[i];
        list[i] = list[i/2];
        list[i/2] = tmp;
        buildMinHeap(list, i/2);
    }
}

void minHeapify(Vertex *list, int i) {
  int l = i*2;
  int r = i*2+1;

  int smallest = i;
  if(l <= cnt && list[l].d < list[smallest].d )  smallest = l;
  if(r <= cnt && list[r].d < list[smallest].d ) smallest = r;

  if(smallest != i) {
    Vertex tmp = list[i];
    list[i] = list[smallest];
    list[smallest] = tmp;
    minHeapify(list, smallest);
  }
}

void displayAnswer(int *a, int n) {
    cout<<0<<' '<<0<<endl;
    for(int i = 1; i < n; i++) {
        cout<<i<<' '<<a[i]<<endl;
    }
}