Codeforces 892E - Envy 【最小生成树】
Codeforces 892E - Envy 【最小生成树】For a connected undirected weighted graph G, MST (minimumspanning tree) is a subgraph of G that contains all of G's vertices, isa tree, and sum of its edges is minimum possible.You are given agraph G. If you run a MST a