Post Office（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH0206162）

Post Office
描述:
There is a straight highway with villages alongside the highway. The highway is represented as an integer axis, and the position of each village is identified with a single integer coordinate There are no two villages in the same position. The distance between two positions is the absolute value of the difference of their integer coordinates.

Post offices will be built in some,but not necessarily all of the villages. A village and the post office in it have the same position. For building the post offices,their positions should be
chosen so that the total sum of all distances between each village and its nearest post office is minimum.

You are to write a proaram which. aiven the positions of the villaaes and the number of post offices,computes the least possible sum of all distances between each village and its nearest post office
输入:

Your program is to read from standard input. The first line contains two integers the frst is the number of vilaaes V1<=V<= 300.and the second is the number of post offices P1<= P <= 30.P<=V.The second line contains V integers in increasing order. These V integers are the positions of the villages.For each position Xit holds thatl<=X<=10000.输出:

The frst line contains one integer S,which is the sum of all distances between each village and its nearest post office

翻译：

邮政局
描述:
有一条笔直的高速公路，公路两旁都是村庄。公路表示成一个整数轴，每个村庄的位置用一个单一的整数坐标来标识不存在两个处于同一位置的村庄。两个位置之间的距离是其整数坐标之差的绝对值。
邮局会在一些,但不一定所有的村庄建立.一个村庄和其中的邮局有相同的位置。为了建造邮局，它们的位置应该是
选择的结果是每个村庄与其最近的邮局之间的所有距离之和最小。
你要写一份...根据村庄的位置和邮局的数量，计算出每个村庄和最近的邮局之间所有距离的最小可能和
输入:
你的程序是从标准输入读取.第一行包含两个整数第一个是 vil aaes 的个数V1 <= V <= 300 和第二是邮局数量P1 <= P <=30.p <= V .第二行包含 V 个以递增顺序的整数。这些 V 的整数是村庄的位置。对于每个位置， Xit 认为 l <= X <= 10000 。输出:
第一条直线包含一个整数 S ， S 是每个村庄到最近邮局的所有距离之和