Loi_Cunese|最小生成树Prim

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int inf=0x3f; 
int n,jl[105];
int a[104][105];
bool bo[105];
int cs=1,tot=0;
int main()
{
	memset(bo,0,sizeof(bo));
	cin>>n;
	for(int i=1;i<=n;i++)
	for(int j=1;j<=n;j++)
	cin>>a[i][j];
	bo[1]=1;
	for(int i=2;i<=n;i++)
	jl[i]=a[i][1];
	for(int j=1;j<=n;j++)
	{
		int minn=9999999;
		for(int i=2;i<=n;i++)
		{
			if(bo[i]==1)
			continue;
			if(jl[i]<minn)
			{
				minn=jl[i];
				cs=i;
			}
		}
		if(minn==9999999)
		break;
		tot+=minn;
		bo[cs]=1;
		for(int i=2;i<=n;i++)
		{
			if(bo[i]==1)
			continue;
			if(jl[i]>a[i][cs])
			jl[i]=a[i][cs];
			
		}
	}
	cout<<tot;
	return 0;
}