Cod sursa(job #1979723)

Utilizator robert.stefanRobert Stefan robert.stefan Data 11 mai 2017 10:55:34
Problema Arbore partial de cost minim Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.55 kb
/* Kruskal */

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <algorithm.h>

#define MAXN 200005
#define MAXM 400005
#define IN "apm.in"
#define OUT "apm.out"

FILE *in = fopen(IN, "r");
FILE *out = fopen(OUT, "w");

int n, m;
int a[MAXM], b[MAXM], c[MAXM];
int index[MAXN];

bool cmp(int x, int y){
	return (c[x] < c[y]);
}

int main(void){

	fscanf(in, "%d%d", &n, &m);

	for (i = 0; i < m; ++i){
		fscanf(in, "%d%d%d", &a[i], &b[i], &c[i]);
		index[i] = i;
	}

	sort(index + 1, index + 1 + m, cmp);

	fclose(in);
	fclose(out);
	return 0;
}