Go: package main

import (
	"fmt"
	"container/heap"
)

type Node struct {
	Id int
	Dis int
}

type PriorityQueue []*Node

func (pq PriorityQueue) Len() int { return len(pq) }

func (pq PriorityQueue) Less(i, j int) bool {
	return pq[i].Dis < pq[j].Dis
}

func (pq PriorityQueue) Swap(i, j int) {
	pq[i], pq[j] = pq[j], pq[i]
}

func (pq *PriorityQueue) Push(x interface{}) {
	*pq = append(*pq, x.(*Node))
}

func (pq *PriorityQueue) Pop() interface{} {
	n := len(*pq)
	pop := (*pq)[n-1]
	*pq = (*pq)[0:n-1]
	return pop
}

func main() {
	var n int
	fmt.Scan(&n)

	g := make([][]int, n)
	c := make([][]int, n)
	pq := make(PriorityQueue, 0, n)
	d := make([]int, n)
	for i := 0; i < n; i++ {
		var u,k int
		fmt.Scan(&u)
		fmt.Scan(&k)
		g[u] = make([]int, k)
		c[u] = make([]int, k)
		for j := 0; j < k; j++ {
			fmt.Scan(&g[u][j])
			fmt.Scan(&c[u][j])
		}

		if u == 0 {
			d[u] = 0
		} else {
			d[u] = 1 << 30
		}
		pq.Push(&Node{u, d[u]})
	}
	heap.Init(&pq)

	for pq.Len() > 0 {
		node := heap.Pop(&pq).(*Node)
		for i := 0; i < len(g[node.Id]); i++ {
			nextId := g[node.Id][i]
			nextDis := node.Dis + c[node.Id][i]
			if nextDis < d[nextId] {
				d[nextId] = nextDis
				heap.Push(&pq, &Node{nextId, nextDis})
			}
		}
	}

	for i := 0; i < n; i++ {
		fmt.Println(i, d[i])
	}
}

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

struct Node
{
    vector<int> cost;
    vector<int> vertex;

    bool visited = false;
    int minCost = 100000000;
};

int N;
vector<Node> firstNodes(100);

int findNode(const vector<Node>& nodes)
{
    int minCost = 1000000000;
    int index = -1;
    for (int i = 0; i < nodes.size(); i++)
    {
        if(minCost > nodes[i].minCost && !nodes[i].visited)
        {
            minCost = nodes[i].minCost;
            index = i;
        }   
    }
    return index;
}

int main()
{
    cin >> N;
    int u;
    int k;
    int temp;
    for(int i = 0;i < N;i++)
    {
        cin >> u;
        cin >> k;
        for(int i = 0;i < k;i++)
        {
            cin >> temp;
            firstNodes[u].vertex.push_back(temp);
            cin >> temp;
            firstNodes[u].cost.push_back(temp);
        }
    }

    firstNodes[0].minCost = 0;
    
    for(int vi = 0;vi < N;vi++)
    {
        vector<Node> nodes = firstNodes;
        while(nodes[vi].visited != true)
        {
            //find a node that is visited and has minimum cost
            int index = findNode(nodes);

            Node& minNode = nodes[index];
            int vertex;
            int cost;
            minNode.visited = true;
            for (size_t i = 0; i < minNode.vertex.size(); i++)
            {
                vertex = minNode.vertex[i];
                cost = minNode.cost[i];
                nodes[vertex].minCost = min(nodes[vertex].minCost,minNode.minCost + cost);
            }
        }
        cout << vi << " " << nodes[vi].minCost << endl;
    }
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <utility>
#include <limits.h>

#define DIRECTED true //有向か無向か
#define ull unsigned long long
#define mp(X , Y) make_pair(X , Y)

using namespace std;

bool operator>(const pair<ull,int> a, const pair<ull,int> b){
    return a.first > b.first;
}

class dijkstra{
public:
    int num;
    vector<ull> dist;
    vector<int> prev;

    vector<vector<pair<int,ull>>> side; 

    dijkstra(){
    }

    dijkstra(int n){

        num = n;
        //0オリジンとの混合を避けるため+1する
        for(int i = 0; i < n + 1; i++){
            dist.push_back(ULONG_LONG_MAX);
            prev.push_back(-1);
            vector<pair<int,ull>> v;
            side.push_back(v);
        }
    }

    void reset(){
        dist.clear();
        prev.clear();

        for(int i = 0; i < num + 1; i++){
            dist.push_back(ULONG_LONG_MAX);
            prev.push_back(-1);

        }
    }

    void input(int f, int t,ull d){

        side[f].push_back(mp(t, d));
        if(!DIRECTED) side[t].push_back(mp(f,d));
    }

    void search(int start){
        
        dist[start] = 0;
        prev[start] = 0;

        priority_queue<pair<ull,int>, vector<pair<ull,int>>, greater<pair<ull,int>>> pq;
        pq.push(mp(0,start));

        while(!pq.empty()){
            
            ull d = pq.top().first;
            int s = pq.top().second;

            for(auto itr = side[s].begin(); itr != side[s].end(); itr++){

                ull tmp_d = (*itr).second;
                int to = (*itr).first; 

                if(dist[to] > d + tmp_d){
                    dist[to] = d + tmp_d;
                    prev[to] = s;
                    pq.push(mp(d + tmp_d,to));
                }
            }

            pq.pop();
        }
    }

    ull min_distance(int to){
        return dist[to];
    }

};

int main(){

    int n,u,k;

    cin >> n;

    dijkstra dijk;
    dijk = dijkstra(n);

    for(int i = 0; i < n; i++){
        scanf(" %d %d",&u,&k);
        for(int j = 0; j < k; j++){
            int v;
            ull c;

            scanf(" %d %llu",&v,&c);

            dijk.input(u,v,c);

        }
    }

    dijk.search(0);
    for(int i = 0; i < n; i++){
        cout << i << " " << dijk.min_distance(i) << endl;
    }
}