老王最近承包了某市的造路工程，假设该市有 n 个地点，老王的任务就是连通这 n 个

地点。当然，由于各种原因，连通任意两个地点的代价是不一样的，于是老王请你帮忙设计

出一个算法，计算连通这 n 个地点所用的最小代价。

-Wang recently contracted a city road construction, assume that the city has n locations, Pharaoh s task is communication with the n

location. Of course, for various reasons, the communication costs of any two locations are not the same, so please help design Pharaoh

An algorithm to calculate the minimum cost of communicating these n locations used.