MST  Minimum Spanning Tree
Find the minimum spanning tree of the graph.
Input
On the first line there will be two integers N  the number of nodes and M  the number of edges. (1 <= N <= 10000), (1 <= M <= 100000)
M lines follow with three integers i j k on each line representing an edge between node i and j with weight k. The IDs of the nodes are between 1 and n inclusive. The weight of each edge will be <= 1000000.
Output
Single number representing the total weight of the minimum spanning tree on this graph. There will be only one possible MST.
Example
Input: 4 5 1 2 10 2 3 15 1 3 5 4 2 2 4 3 40 Output: 17
hide comments
ravi_ndra12345:
20170514 08:08:41
I am getting 81.82.


sidku97:
20170426 17:14:46
Getting 18.18 and green colour?


diegoenojado:
20170418 06:40:57
Is it possible to achieve 100 points with Prim algorithm? Couldnt make it 

sdfgsdgs:
20170318 20:46:28
result 0 memory 0 time 0?


theo_pap1:
20170304 16:23:12
I get 100 on result ... why isn't it accepted?


Sajal Sarkar:
20170102 11:55:48
Aren't partial problems counted in solved problems? 

vanvinhbk94:
20161201 14:58:35
AC in 1 go!!! easy Kruskal 

rupeshyadav:
20161108 02:51:08
i got 100 but not accepted what is this? can some one explain this to me? 

bhedavivek:
20161019 19:56:16
A little help pls, new to SPOJ


hung:
20161013 08:28:52
Fucking Long long == 
Added by:  Nikola P Borisov 
Date:  20081020 
Time limit:  1s2s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 