在一个按照东西和南北方向划分成规整街区的城市里，n个居民点散乱地分布在不同的街区中。用x 坐标表示东西向，用y坐标表示南北向。各居民点的位置可以由坐标(x,y)表示。街区中任意2 点(x1,y1)和(x2,y2)之间的距离可以用数值|x1-x2|+|y1-y2|度量。

居民们希望在城市中选择建立邮局的最佳位置，使n个居民点到邮局的距离总和最小。

编程任务：

给定n 个居民点的位置,编程计算n 个居民点到邮局的距离总和的最小值。

-In a direction in accordance with the East-West and North-South divided into regular city blocks, n settlements scattered distribution in different neighborhoods in. Things used to express the coordinates x, y coordinates used to express the North and the South. The location of the settlements by the coordinates (x, y) express. Arbitrary blocks 2:00 (x1, y1) and (x2, y2) can use the distance between the values | x1-x2 |+ | y1-y2 | metrics. Residents want to set up at select post offices in the city the best location, so that n settlements to the post office the sum of the smallest distance. Programming tasks: given n the location of settlements, programming calculation n settlements to the post office the sum of the minimum distance.