Can someone please post a good explanation of DIV2 C.

use long double throughout

Instead of augmenting by 1 you can augment by min((k-costsofar)/cost_for_reaching_sink,maxflow).

Can you please explain what do u mean by the graph is special and how will it pass using max flow algorithms?

I first added the bridges to the MST and then applied kruskal....it passed all tests,dont know if its actually correct.

I would really appreciate if the codes are well commented....