Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"fmt"
	)

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

func main() {
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		matrix := make([][]int, 10)
		for i := range matrix {
			matrix[i] = make([]int, 10)
		}
		for i := range matrix {
			for j := range matrix[i] {
				if i == j {
					matrix[i][j] = 0
				} else {
					matrix[i][j] = INF
				}
			}
		}
		num := 0
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			from, _ := strconv.Atoi(buf[0])
			to, _ := strconv.Atoi(buf[1])
			cost, _ := strconv.Atoi(buf[2])
			if num < from {
				num = from
			}
			if num < to {
				num = to
			}
			matrix[from][to] = cost
			matrix[to][from] = cost
		}
		num++
		for i := 0; i < num; i++ {
			for j := 0; j < num; j++ {
				for k := 0; k < num; k++ {
					if matrix[j][i]+matrix[i][k] < matrix[j][k] {
						matrix[j][k] = matrix[j][i]+matrix[i][k]
					}
				}
			}
		}
		ans, sum := 0, INF
		for i := 0; i < num; i++ {
			now := 0
			for j := 0; j < num; j++ {
				now += matrix[i][j]
			}
			if sum > now {
				sum = now
				ans = i
			}
		}
		fmt.Println(ans, sum)
	}
}

C++: 
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <tuple>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<vector<PII> > VVPII;
typedef priority_queue<PII, vector<PII>, greater<PII> > PQPII;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int DX[] = {0, 1, 0, -1};
const int DY[] = {-1, 0, 1, 0};

//other
//--------------------------------------------
#define RANGE(a, c, b) ((a <= b) && (b < c))

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int dijkstra(int from, int town_count, VVPII & nodes){
	VI dist(town_count, 10e7);
	PQPII q;
	dist[from] = 0;
	q.emplace(0, from);
	while(!q.empty()){
		PII town = q.top();
		int minute = town.first;
		int from = town.second;
		q.pop();
		if(dist[from] < minute) continue;
		for(PII node : nodes[from]){
			int to_cost = node.first;
			int to = node.second;
			
			if(to_cost + dist[from] < dist[to]){
				dist[to] = to_cost + dist[from];
				q.emplace(dist[to],  to);
			}
		}
	}
	int sum = 0;
	REP(i, town_count){
		sum +=  dist[i];
	}
	return sum;
}

int main(int argc, char const *argv[])
{
	for(int n; cin >> n, n;){
		VVPII data(10);
		int town_count = 0;
		REP(i, n){
			int from, to, minute;
			cin >> from >> to >> minute;
			town_count = max(from, max(to, town_count));
			data[from].PB(MP(minute, to));
			data[to].PB(MP(minute, from));
		}
		REP(i, town_count){
			REP(j, data[i].size()){
				PII p = data[i][j];
				int cost = p.first;
				int to = p.second;
			}
		}
		town_count++;
		// dump(town_count);
		int ans = 10e8;
		int town_number;
		REP(i, town_count){
			int temp = dijkstra(i, town_count, data);
			if(ans > temp){
				ans = temp;
				town_number = i;
			}
		}
		cout << town_number << " " << ans << endl;
	}

	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
	//町の数が10個以下なのでワーシャルフロイドでも時間制限に間に合う
	int path,n,i,j,k;
	int length[10][10]={};

	//初期化
	while(cin>>path && path != 0){

		for(int u = 0; u < 10; u++){
			for (int v = 0; v < 10; v++)
			{
				if(u==v){
					length[u][v]=0;
				}else{
					length[u][v]=10*100;
				}
			}

		}

		for(n=0;n<path;n++){
			cin>>i>>j;
			cin>>length[i][j];
			length[j][i]=length[i][j];
		}
		//本計算
		n=10;
		for(k = 0; k < n; k++){
			for ( i = 0; i < n; i++){
				for (j = 0; j < n; j++)
				{
					if(length[i][j]>length[i][k]+length[k][j]){
						length[i][j]=length[i][k]+length[k][j];

					}
				}
			}
		}
		int dsum[10]={};
		for(i=0; i<10; i++){
			for (j = 0; j < 10; j++)
			{
				if(length[i][j]==10*100){
					length[i][j]=0;
				}
				dsum[i]+=length[i][j];
			}
		}


		int min=10*100;
		int minindex=0;
		for(i=0;i<10;i++){
			if(min>dsum[i] && dsum[i]!=0){
				min=dsum[i];
				minindex=i;
			}

		}

		cout<<minindex<<" "<<min<<endl;

	}
}

C++: // 2014/06/16 Tazoe

#include <iostream>
using namespace std;

const int INF = 1000000000;

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

		if(n==0)
			break;

		int T[10][10];
		for(int i=0; i<10; i++){
			for(int j=0; j<10; j++){
				if(i==j){
					T[i][j] = 0;
				}
				else{
					T[i][j] = INF;
				}
			}
		}

		int m = 0;		// ���̑���

		for(int i=0; i<n; i++){
			int a, b, c;
			cin >> a >> b >> c;

			T[a][b] = T[b][a] = c;

			if(a+1>m){
				m = a+1;
			}
			if(b+1>m){
				m = b+1;
			}
		}

    for(int k=0;k<m;k++){
      for(int i=0;i<m;i++){
        for(int j=0;j<m;j++){
          if(T[i][j] > T[i][k]+T[k][j])
            T[i][j] = T[i][k] + T[k][j];
        }
      }
    }
    int min_town_n;
    int min_town_time = INF;
    for(int k=0;k<m;k++){
      int sub = 0;
      for(int i=0;i<m;i++){
        if(T[k][i] != INF)
          sub += T[k][i];
          //cout << T[k][i] << ",";
      }
      //cout << " sub = " << sub << endl;
      if(min_town_time > sub){
        min_town_time = sub;
        min_town_n = k;
      }
    }
    cout << min_town_n << ' ' << min_town_time << endl;
	}

	return 0;
}