Cod sursa(job #689180)

Utilizator alex15Balan Alexandru-Mihai alex15 Data 24 februarie 2012 10:41:07
Problema Arbore partial de cost minim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include<fstream>
using namespace std;

ifstream in("apm.in");
ofstream out("apm.out");

struct muchie{
int x,y,c;
};

muchie vm[5000],h[100];
int n,m,ct,c[100];

void citire(){
in>>n>>m;
for(int i=1;i<=m;i++)
in>>vm[i].x>>vm[i].y>>vm[i].c;
}

void sort(){
int i,j;
muchie aux;
for(i=1;i<m;i++)
for(j=i+1;j<=m;j++)
if(vm[i].c>vm[j].c){
aux=vm[i];
vm[i]=vm[j];
vm[j]=aux;
}
}

void apm(){
int i;
for(i=1;i<=n;i++)
c[i]=i;
sort();
int msel=0;
i=1;
while(msel<n-1){
while(c[vm[i].x]==c[vm[i].y])
i++;
msel++;
h[msel]=vm[i];
int min=c[vm[i].x],max=c[vm[i].x];
if(c[vm[i].y]>max)
max=c[vm[i].y];
if(c[vm[i].y]<min)
min=c[vm[i].y];
for(int j=1;j<=n;j++)
if(c[j]==max)
c[j]=min;
ct+=vm[i].c;
}
}

int main(){
citire();
apm();
out<<ct<<" \n";
for(int i=1;i<n;i++)
out<<h[i].x<<" "<<h[i].y<<" "<<h[i].c<<" \n";
return 0;
}