need help to understand a solution from hackerreank recent week of code
problem link-Programming Problems and Competitions
i am unable to understand editorial completly an help will be appreciated
sir I am facing a problem in which i am given a graph in which weight of edges is given as a pair (a,b) and we have to make it a spanning tree such that after removing edges the tree formed has maximum value of
(sigma a)/(sigma b).
I have tried a greedy approach but that was wrong please guide me through this. thanks anyway