Hint: e.g. for N=6, S=13 edges in mst = N-1 = 5

Consider 3 cases of edge costs:

• 1, 1, 1, 1, 9 (min comes first)
• 2, 2, 3, 3, 3 (average comes first, with rest spread)
• 2, 2, 2, 2, 5 (average comes first, rest at last)

Here is my solution in java, javascript, python, C, C++, Csharp HackerRank Minimum MST Graph Solution

Here is the solution of Minimum MST Graph Click Here

It's very interesting information!

https://zeroplusfour.com/minimum-mst-graph-hackerrank-solution/

Here's how I did in all languages Java 8 , C++ , C , Python 3, Python 2.