Well Project - NDDCoder

#include<iostream>

using namespace std;
int T, tc;
int n;
int a[100][100];
int chosen[100], dis[100], prev[100];

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
//	freopen("WellProject.txt","r",stdin);
	cin>>T;
	for (tc=1;tc<=T;tc++){
		cout<<"Case #"<<tc<<endl;
		cin>>n;
		for (int i=0;i<n;i++){
			for (int j=0;j<n;j++){
				cin>>a[i][j];
			}
			chosen[i]=0;
			prev[i]=i;
		}
		chosen[0]=1;
		dis[0]=0;
		for (int i=1;i<n;i++){
			dis[i]=a[0][i];
			prev[i]=0;
		}
		int imin;
		for (int loop=0;loop<n-1;loop++){
			int nmin=-1;
			for (int i=0;i<n;i++){
				if (!chosen[i]){
					if (nmin==-1||dis[i]<nmin){
						nmin=dis[i];
						imin=i;
					}
				}
			}
//			cout<<"min "<<imin<<" "<<nmin<<endl;
			if (nmin!=-1){
				chosen[imin]=1;
				for (int i=1;i<n;i++){
					if (i!=imin && !chosen[i] && dis[i]>a[imin][i]){
						dis[i]=a[imin][i];
						prev[i]=imin;
					}
				}
			}
		}
		int result=0;
//		int pre = imin;
//		int v1, v2;
//		do{
//			v1=pre;
//			pre=prev[pre];
//			v2=pre;
//			cout<<v1<<" "<<v2<<endl;
//			result+=a[v1][v2];
//		}while(v1!=v2);
		for (int i=0;i<n;i++) result+=dis[i];
		cout<<result<<endl;
	}
}