Go: package main

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

//make priority queue
type Item struct {
	id       int
	priority int // this state is priority and distans from start
	index    int
}

type PriorityQueue []*Item

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

// we want the ascending-priority-queue.
// So we use less than here.
func (pq PriorityQueue) Less(i, j int) bool {
	return pq[i].priority < pq[j].priority
}

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

func (pq *PriorityQueue) Push(x interface{}) {
	n := len(*pq)
	item := x.(*Item)
	item.index = n
	*pq = append(*pq, item)
}

func (pq *PriorityQueue) Pop() interface{} {
	old := *pq
	n := len(old)
	item := old[n-1]
	item.index = -1 //for safety
	*pq = old[0 : n-1]
	return item
}

func (pq *PriorityQueue) update(dist int, id int) {
	for _, i := range *pq {
		if i.id == id {
			if i.priority > dist {
				i.priority = dist
			}
		}
	}
}

// the main code
func nextInt(sc *bufio.Scanner) int {
	sc.Scan()
	n, _ := strconv.Atoi(sc.Text())
	return n
}

func dikstra(dist [][]int, n int) []int {
	// preparate priority queue
	inf := 1 << 30
	pq := make(PriorityQueue, n)
	shortests := make([]int, n)
	for i := 0; i < n; i++ {
		pq[i] = &Item{
			id:       i,
			priority: inf,
			index:    i,
		}

		shortests[i] = inf
	}
	pq[0].priority = 0
	shortests[0] = 0

	for pq.Len() > 0 {
		item := heap.Pop(&pq).(*Item)
		shortests[item.id] = item.priority
		for id, d := range dist[item.id] {
			if d != -1 {
				pq.update(item.priority+d, id)
			}
		}
		heap.Init(&pq)
	}
	return shortests
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	// init
	n := nextInt(sc)
	dist := make([][]int, n)
	for i := 0; i < n; i++ {
		dist[i] = make([]int, n)
		for j := 0; j < n; j++ {
			dist[i][j] = -1
		}
	}

	// std Input
	for i := 0; i < n; i++ {
		u := nextInt(sc)
		k := nextInt(sc)
		for j := 0; j < k; j++ {
			v, c := nextInt(sc), nextInt(sc)
			dist[u][v] = c
		}
	}

	shortests := dikstra(dist, n)
	for i, d := range shortests {
		fmt.Printf("%d %d\n", i, d)
	}
}

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

C++: #include <cstdio>
#include <vector>

int main(void){

	int n, count, next_node, num_neighbors, min_distance;
	std::vector< std::vector<int> > edges;
	std::vector< std::vector<int> > neighbors;
	std::vector<bool> isUsed;
	std::vector<int> distance;
	scanf("%d", &n);
	edges.resize(n);
	isUsed.resize(n);
	neighbors.resize(n);
	distance.resize(n);
	for(int i=0;i<n;i++){
		scanf("%d %d", &next_node, &num_neighbors);
		edges[next_node].resize(num_neighbors);
		neighbors[next_node].resize(num_neighbors);
		for (int j=0;j<num_neighbors;j++){
			scanf("%d %d", &neighbors[next_node][j], &edges[next_node][j]);
		}
		isUsed[next_node]=-false;
		distance[next_node]=-1;
	}
	isUsed[0] = true;
	distance[0] = 0;
	count=0;
	for(int i=0;i<neighbors[0].size();i++){
		distance[neighbors[0][i]] = edges[0][i];
	}
	int neighbor;
	while(count<n-1){
		min_distance = 100000;
		for(int i=0;i<n;i++){
			if(!isUsed[i] && distance[i] != -1 && distance[i]<min_distance){
				next_node = i;
				min_distance = distance[i];
			}
		}
		isUsed[next_node] = true;
		for(int i=0;i<neighbors[next_node].size();i++){
			neighbor = neighbors[next_node][i];
			if(distance[neighbor] > distance[next_node]+edges[next_node][i] || distance[neighbor] <0){
				distance[neighbor] = distance[next_node] + edges[next_node][i];
			}
		}
		count ++;
	}
	for(int i=0;i<n;i++){
		printf("%d %d\n", i, distance[i]);
	}
	return 0;
}