Pagini recente » Rezultatele filtrării | Rezultatele filtrării | Cod sursa (job #345182) | Cod sursa (job #1012163) | Cod sursa (job #689269)
Cod sursa(job #689269)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
struct muchie{
int x,y,c;
};
muchie vm[400001],h[200000];
int n,m,ct,c[200000];
int fcmp(void const *a,void const *b){
return ((pm)a)->c-((pm)b)->c;
}
void citire(){
int i;
fin>>n>>m;
for(i=1;i<=m;i++)
fin>>vm[i].x>>vm[i].y>>vm[i].c;
}
void apm(){
int i,j;
for(i=1;i<=n;i++)
c[i]=i;
qsort(vm+1,m,sizeof(vm[0]),fcmp);
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) max=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();
fout<<ct<<"\n"<<n-1<<"\n";
for(int i=1;i<n;i++)
fout<<h[i].x<<" "<<h[i].y<<"\n";
}