#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn=100,maxm=1000000;
int A[maxn][maxn];
int main()
{
    int n,m,a,b;
    while (cin>>n &&  n)
    {
       for (int i=0;i<n;i++)
         for (int j=0;j<0;j++)
           A[i][j]=maxm;
       for (int i=0;i<n;i++)
       {
           scanf("%d",&m);
           for (int j=0;j<m;j++)
           {
               scanf("%d%d",&a,&b);
               A[i][a-1]=b;
           }
       }
       for (int k=0;k<n;k++)
         for (int i=0;i<n;i++)
           for (int j=0;j<n;j++)
             if (i!=j) A[i][j]=min(A[i][j],A[i][k]+A[k][j]);
       int k,ans=maxm;
       for (int i=0;i<n;i++)
       {
           int max=0;
           for (int j=0;j<n;j++)
             if (i!=j && A[i][j]>max)
               max=A[i][j];
           if (max<ans)
           {
             ans=max;
             k=i;
           }
       }
       cout<<k+1<<" "<<ans<<endl;
    }
    return 0;
}

• Re:贴码 (11) Matoka 2016-10-03 14:41:25
  • Re:贴码 (16) King1jy 2017-02-03 17:39:10
• Re:贴码 (1097) zjf1649311651 2016-10-03 14:49:20
• Re:贴码 (1097) 611051 2022-04-08 21:38:40
• Re:贴码 (1097) 611051 2022-04-08 21:39:34