hdu 1301 jungle roads

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define INF 0x3f3f3f3f
using namespace std;


int map[1000][1000];
int vis[10000];
int village;
int lowcost[20];


int prim()
{
int temp;
int i,j;
int sum;
int k;
memset(vis,false,sizeof(vis));
vis[1]=true;
for(i=1;i<=village;i++)
lowcost[i]=map[1][i];
sum=0;
for(i=1;i<=village;i++)
{
temp=INF;
for(j=1;j<=village;j++)
{
if(!vis[j]&&lowcost[j]<temp)
{
temp=lowcost[k=j];
}
}
if(temp==INF)
break;
vis[k]=true;
sum+=temp;
for(j=1;j<=village;j++)
{
if(!vis[j]&&lowcost[j]>map[k][j])
lowcost[j]=map[k][j];
}
}
return sum;
}


int main()
{
int road;
int x,y;
char c1[5],c2[5];
int i,j;
int n,m;
while(scanf("%d",&village)&&village)
{
memset(map,INF,sizeof(map));
for(i=1;i<village;i++)// i start from 1 to 8
{
scanf("%s%d",c1,&n);//这里的输入要注意 
x=c1[0]-'A'+1;
printf("%d\n",x);
for(j=1;j<=n;j++)
{
scanf("%s%d",c2,&m);
y=c2[0]-'A'+1;
//if(map[x][y]>m)
map[x][y]=map[y][x]=m;
}
}
printf("%d\n",prim());
}
return 0;
}
//prime算法