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 <vector>
#include <utility>
#include <queue>
#define INF 10000000
#define MAX 10000
using namespace std;

// ====== Implement of Heap ======
int heap[2000000]={INF};
int eoh=1;

void minHeapify(int* A, int i){
  int h = eoh-1;
  int l = 2*i;
  int r = 2*i+1;
  int smallest;
  if ( l <= h && A[l] < A[i] )
    smallest = l;
  else
    smallest = i;

  if ( r<= h && A[r] < A[smallest])
    smallest = r;

  if (smallest != i){
    swap(A[i], A[smallest]);
    minHeapify(A, smallest);
  }
}

void insert(int v, int p=-1){
  if (p == -1){
    p = eoh++;
    heap[p] = v;
    insert(v, p);
    return;
  }
  if (p == 1)
    return;
  int parent = heap[p/2];
  if (parent < v)
    return;
  swap(heap[p/2], heap[p]);
  insert(v, p/2);
}

int del(void){
  if (eoh == 1)
    return -1;
  int res = heap[1];
  heap[1] = heap[eoh-1];
  eoh--;
  minHeapify(heap, 1);
  return res;
}
// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ 

// ====== Implement of List Structure ======
struct Node {
    int to, cost;
    struct Node * next;
};

typedef struct Node * NodePointer;

NodePointer NIL;

NodePointer makeNode(int to, int cost){
    NodePointer newNode = (NodePointer)malloc(sizeof(struct Node));
    newNode->to = to;
    newNode->cost = cost;
    newNode->next = NIL;
    return newNode;
}

NodePointer insert(NodePointer head, int to, int cost){
    NodePointer ite, newNode;
    for (ite=head;ite->next!=NIL;ite=ite->next);
    newNode = makeNode(to, cost);
    ite->next = newNode;
    return newNode;
}


// decl vals
int dist[MAX];

void dijkstraAlgorithm(NodePointer vertex[], int n){
  auto compare = [=](int i, int j){return dist[i] >= dist[j];};
  priority_queue<int, vector<int>,  decltype(compare)> searchQueue {compare}; 

  // Initialize of distance, previous and Push all of vectex to queue 
  dist[0] = 0;
  for (int i=0;i<n;i++){
    if (i!=0) dist[i] = INF;
    searchQueue.push(i);
  }

  while(!searchQueue.empty()){
    int current = searchQueue.top();
    NodePointer ite;
    searchQueue.pop();
    for (ite=vertex[current]->next;ite!=NIL;ite=ite->next){
      int alt = dist[current]+ite->cost;
      if ( dist[ite->to] > alt ){
        dist[ite->to] = alt;
        searchQueue.push(ite->to);
      }
    }
  }
}

int main(){
  NodePointer vertex[MAX];
  int i, n;
  cin >> n;
  NIL = makeNode(0, 0);
  for(i=0;i<n;++i) vertex[i] = makeNode(-1,INF);
  
  for (int i=0;i<n;++i){
    int id, k;
    scanf("%d%d", &id, &k);
    for (int j=0;j<k;++j){
      int node, cost;
      scanf("%d%d", &node, &cost);
      insert(vertex[id], node, cost);
    }
  }

  dijkstraAlgorithm(vertex, n);

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

  return 0;
}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;

#define BIG_NUM 2000000000

using namespace std;

struct Node{

	Node(int arg_to,int arg_cost){
		to = arg_to;
		cost = arg_cost;
	}
	bool operator<(const struct Node &arg) const{
			return cost > arg.cost;
	};

	int to,cost;
};

int main(){

	int N;
	scanf("%d",&N);

	vector<Node> V[N];

	int node,num,to,cost,D[N];;

	for(int loop = 0; loop < N; loop++){
		scanf("%d",&node);
		scanf("%d",&num);
		for(int i = 0; i < num; i++){
			scanf("%d %d",&to,&cost);
			V[node].push_back(Node(to,cost));
		}
		D[loop] = BIG_NUM;
	}

	D[0] = 0;

	bool visited[N];
	for(int i = 1; i < N; i++)visited[i] = false;
	visited[0] = true;

	priority_queue<Node> Q;

	for(int i = 0; i < V[0].size(); i++){
		D[V[0][i].to] = V[0][i].cost;
		Q.push(Node(V[0][i].to,V[0][i].cost));
	}

	int min_index;

	while(!Q.empty()){
		if(Q.top().cost == D[Q.top().to]){
			min_index = Q.top().to;
			Q.pop();
		}else{
			Q.pop();
			continue;
		}

		for(int k = 0; k < V[min_index].size(); k++){ //min_index?????????????????´?????§????????¨??´??°??§??????????????§???min_index?????????????????¨?????????????????¢???
			if(D[V[min_index][k].to] > D[min_index] + V[min_index][k].cost){
				D[V[min_index][k].to] = D[min_index] + V[min_index][k].cost;
				Q.push(Node(V[min_index][k].to,D[V[min_index][k].to]));
			}
		}
	}

	for(int i = 0; i < N; i++)printf("%d %d\n",i,D[i]);

    return 0;
}