project euler problem 107

Minimal network

This is a simple minimum spanning tree problem. The algorithm is readily found in CLRS. I checked my old code, it runs pretty fast, but I wrote my own version of  minheap. This time, I used STL's maxheap. It helps to reduce 40% of the code.  But I found my old code runs faster.