Go: package main

import (
	"bufio"
	"container/heap"
	"fmt"
	"os"
	"strconv"
)

const NIL = -1

type Node struct {
	id     int
	weight int
}

func init() {
	sc.Split(bufio.ScanWords)
}

type NodeHeap []Node

func (h NodeHeap) Len() int           { return len(h) }
func (h NodeHeap) Less(i, j int) bool { return h[i].weight < h[j].weight }
func (h NodeHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *NodeHeap) Push(x interface{}) {
	*h = append(*h, x.(Node))
}

func (h *NodeHeap) Pop() interface{} {
	old := *h
	n := len(old)
	x := old[n-1]
	*h = old[0 : n-1]
	return x
}

var sc = bufio.NewScanner(os.Stdin)

func scanInt() int {
	num, _ := strconv.Atoi(scanString())
	return num
}

func scanString() string {
	sc.Scan()
	return sc.Text()
}

func init() {
	sc.Split(bufio.ScanWords)
}

func main() {
	n := scanInt()

	route := make([][]Node, n)
	weight := make([]int, n)
	for i := 0; i < n; i++ {
		weight[i] = NIL
	}

	for i := 0; i < n; i++ {
		u := scanInt()
		k := scanInt()
		route[i] = make([]Node, k)
		for j := 0; j < k; j++ {
			route[u][j] = Node{id: scanInt(), weight: scanInt()}
		}
	}

	start := Node{id: 0, weight: 0}
	h := &NodeHeap{start}
	heap.Init(h)

	for h.Len() > 0 {
		node := heap.Pop(h).(Node)
		if weight[node.id] != NIL {
			continue
		}
		weight[node.id] = node.weight

		for _, nextNode := range route[node.id] {
			if weight[nextNode.id] != NIL {
				continue
			}
			nextNode.weight += node.weight
			heap.Push(h, nextNode)
		}
	}

	for i, w := range weight {
		fmt.Println(i, w)
	}
}

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

C++: #include <iostream>
#include <vector>
using namespace std;

int main() {
    int n;
    cin >> n;

    int a[n][n];
    int done[n]; // -1: まだ ソレ以外: 確定距離
    for (int i = 0; i < n; ++i) {
        done[i] = -1;
        for (int j = 0; j < n; ++j) {
            a[i][j] = -1;
        }
    }
    for (int i = 0; i < n; ++i) {
        int u, k;
        cin >> u >> k;
        for (int j = 0; j < k; ++j) {
            int v, c;
            cin >> v >> c;
            a[i][v] = c;
        }
    }

    // デバッグ用
//     for (int i = 0; i < n; ++i) {
//         for (int j = 0; j < n; ++j) {
//             cout << i << " " << j << " " << a[i][j] << endl;
//         }
//     }

    // 最初は0が確定済みのノードとなる
    done[0] = 0;

    // 確定済みのノードから行ける、未到達の最小のノードを探す
    // その最小のノードは次の確定済みとする...
    // とりあえずデバッグがてら10回す (最終的にwhileにして条件で対応する)
    // 全てdoneになったら終了
    for (int r = 0; r < n-1; ++r) {
        int next_node = -1;
        int next_cost = 1000000;
        for (int i = 0; i < n; ++i) {
            if (done[i] == -1) {
                // 未確定であれば何もしない
                continue;
            }

            for (int j = 0; j < n; ++j) {
                // 到達済みは見ない
                if (done[j] != -1) {
                    continue;
                }

                // コストが-1なら到達できない
                if (a[i][j] == -1) {
                    continue;
                }

                // 行けるところのコスト (iまでの距離+そこからの距離) を探す
//                cout << "src:" << i << " dst:" << j << " cost:" << a[i][j] << " total:" << done[i] + a[i][j] << endl;

                // 今のnext_costよりもtotalcostが小さければ、次のノードにしたい
                if ((done[i] + a[i][j]) < next_cost) {
                    next_cost = done[i] + a[i][j];
                    next_node = j;
                }
            }
        }
//        cout << "iter:" << r << endl;
//        cout << "next_node:" << next_node << endl;
//        cout << "next_cost:" << next_cost << endl;
        done[next_node] = next_cost;
    }

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

    return 0;
}