Go: package main

import (
	"fmt"
	"bufio"
	"os"
	"strconv"
	"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)

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

	g := make([][]int, n)
	c := make([][]int, n)
	pq := make(PriorityQueue, 0, n)
	d := make([]int, n)
	for i := 0; i < n; i++ {
		sc.Scan()
		u, _ := strconv.Atoi(sc.Text())
		sc.Scan()
		k, _ := strconv.Atoi(sc.Text())
		g[u] = make([]int, k)
		c[u] = make([]int, k)
		for j := 0; j < k; j++ {
			sc.Scan()
			g[u][j], _ = strconv.Atoi(sc.Text())
			sc.Scan()
			c[u][j], _ = strconv.Atoi(sc.Text())
		}

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

	wr := bufio.NewWriter(os.Stdout)
	for i := 0; i < n; i++ {
		wr.WriteString(strconv.Itoa(i))
		wr.WriteString(" ")
		wr.WriteString(strconv.Itoa(d[i]))
		wr.WriteString("\n")
	}
	wr.Flush()
}

C++: #include<stdio.h>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<queue>
#include<functional>
using namespace std;
int main(){
	int a;
	int b;
	int s;
	int t;
	vector<int> n[10000];
	int nn[10000];
	vector<int> x[10000];
	priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > >y;
	vector<pair<int, int> >::iterator yy;
	int z;
	int d[10000];
	int e;
	int c[10000];
	int zz;
	pair<int, int>pai;
	for (int i = 0; i < 10000; i++){
		d[i] = 1000000009;
		c[i] = 0;
	}
	scanf("%d", &a);
	for (int i = 0; i < a; i++){
		scanf("%d %d", &s, &b);
		for (int j = 0; j < b; j++){
			scanf("%d %d",&t, &e);
				n[s].push_back(t);
				nn[s]++;
				x[s].push_back(e);

		}
	}
	d[0] = 0;
	y.push(std::make_pair(d[0], 0));
	for (int i = 0; y.empty() == 0; i++){
		zz = 0;
		for (int j = 0; y.empty() == 0 && zz == 0; j++){
			pai = y.top();
			z = pai.second;
			if (c[z] == 0)zz++;
			else y.pop();
		}
		if (zz == 0)break;
		c[z] = 1;
		printf("%d %d\n",z, d[z]);
		for (int j = 0; j < nn[z]; j++){
			if (d[z] + x[z][j] < d[n[z][j]])
			{
				d[n[z][j]] = d[z] + x[z][j];
				y.push(std::make_pair(d[n[z][j]], n[z][j]));
			}
		}
		y.pop();
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

int cost[100][100];//cost[a][b] a??????b????§?????????????????????????
long long int d[100];//??????s?????????????°??????¢
bool used[100];
int arrow;//????????°

const int INF = 10000000;

void dijkstra(){
  fill(d,d+arrow,INF);
  fill(used,used + arrow,false);
  d[0] = 0;

  while(1){
    int v=-1;
    // ???????????????????????????????????????????????¢???????°???????????????¢???
    for(int u=0;u<arrow;u++){
      if(!used[u] && (v == -1 || d[u] < d[v])) v = u;
    }

    if(v == -1) break;

    used[v] = true;

    for(int u=0; u<arrow; u++){
      if(cost[v][u] != INF){
        d[u] = min(d[u],d[v] + cost[v][u]);
      }
    }
  }

  for(int u=0; u<arrow; u++){
    cout << u << " " << d[u] << endl;
  }

}

int main(){

    cin >> arrow;

    int n,a,v,c;



    for(int i=0;i<arrow;i++){
      for(int j=0;j<arrow;j++){
        cost[i][j] = INF;
      }
    }

    for(int u=0;u<arrow;u++){

      cin >> n >> a;

      for(int i=0; i<a;i++){
        cin >> v >> c;
        cost[n][v] = c;
      }
    }

    dijkstra();

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
typedef pair<int,int> pp;
const int INF = 1001001001;
struct edge{int to, cost;};

int main() {
    int V;
    cin >> V;
    vector< vector<edge> > A(V);
    for(int i=0; i<V; i++) {
        int u,k;
        cin >> u >> k;
        A[u].resize(k);
        for(int j=0; j<k; j++) {
            int v,c;
            cin >> v >> c;
            struct edge e = {v,c};
            A[u][j] = e;
        }
    }

    vector<int> d(V,INF);
    d[0] = 0;
    priority_queue< pp, vector<pp>, greater<pp> > Q;
    Q.push(pp(d[0],0));
    
    while(!(Q.empty())) {
        pp temp = Q.top();
        Q.pop();
        int ct = temp.first;
        int u = temp.second;
        for(int j=0; j<A[u].size(); j++) {
            int v = A[u][j].to;
            int tmpcost = A[u][j].cost;
            if(d[v] > ct + tmpcost) {
                d[v] = ct + tmpcost;
                Q.push(pp(d[v], v));
            }
        }
    }

    for(int i=0; i<V; i++) cout << i << " " << d[i] << endl;
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;

const int INF = numeric_limits<int>::max();

struct Graph {
    struct edge {
        int v, c;
    };
    vector<vector<edge>> adj;
    vector<int> d;
    Graph(int n) {
        adj.assign(n, vector<edge>());
        d.assign(n, INF);
    }
};

int main()
{
    int n;
    cin >> n;
    Graph g(n);
    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;
            g.adj[i].push_back({v, c});
        }
    }

    priority_queue<P, vector<P>, greater<P>> pq;
    g.d[0] = 0;
    pq.push(P(0, 0));
    while (!pq.empty()) {
        int c = pq.top().first;
        int u = pq.top().second;
        pq.pop();
        if (g.d[u] < c) continue;
        for (auto e : g.adj[u]) {
            if (g.d[e.v] > g.d[u] + e.c) {
                g.d[e.v] = g.d[u] + e.c;
                pq.push(P(g.d[e.v], e.v));
            }
        }
    }

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

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
static const int R =10000;
static const int IF = (1<<20);
static const int WH = 0;
static const int GR =1;
static const int BL =2;

int num;
vector<pair<int,int> > ax[R];

void dx(){
  priority_queue<pair<int,int> > Pi;
  int IR[R],i,j,y,x;
  int D[R];

  for(i=0;i<num;i++){
    D[i] = IF;
    IR[i] = WH;
  }

  D[0] = 0;
  Pi.push(make_pair(0,0));
  IR[0] =GR;

  while(!Pi.empty()){
    pair<int,int> F=Pi.top();
    Pi.pop();
    x =F.second;

    IR[x] =BL;

    if(D[x] < F.first * (-1)){
      continue;
    }

    for(j=0;j<ax[x].size();j++){
       y= ax[x][j].first;
       
      if(IR[y] ==BL){
	continue;
      }
      if(D[y] > D[x] + ax[x][j].second){
	 D[y] = D[x] + ax[x][j].second;
	 Pi.push(make_pair(D[y] * (-1),y));
	 IR[y] = GR;
	 }
    }
  }

  for(int i=0;i<num;i++){
    cout << i << " " << (D[i] == IF ? -1 : D[i] ) << endl;
  }
}

int main(){
  int z,x,y,ci,i,j;

  cin >> num;
  for(i=0;i<num;i++){
    cin >> x >> z;

    for(j=0;j<z;j++){
      cin >> y >> ci;
      ax[x].push_back(make_pair(y,ci));
    }
  }
  dx();

  return 0;
}