1125 Stockbroker Grapevine(Floyed)

 

 

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 110;
int e[MAXN][MAXN];
int n;
int main(){
	while(~scanf("%d", &n) && n){
		fill(e[0], e[0] + MAXN*MAXN, INF);
		for(int a = 1; a <= n; ++a){
			int b, m, c;
			scanf("%d", &m);
			while(m--){
				scanf("%d%d", &b, &c);
				e[a][b] = c;
			}
		}
		for(int k = 1; k <= n; ++k)
			for(int i = 1; i <= n; ++i)
				for(int j = 1; j <= n; ++j)
					e[i][j] = min(e[i][j], e[i][k] + e[k][j]);
		int ret = INF, u = 0;
		for(int i = 1; i <= n; ++i){
			int minn = 0;
			for(int j = 1; j <= n; ++j)
				if(e[i][j] > minn && i != j)
					minn = e[i][j];
			if(ret > minn)	ret = minn, u = i;
		}
		printf("%d %d\n", u, ret);
	}
	return 0;
}