Post Office（https://acs.jxnu.edu.cn/problem/NOIOPJCH0206162/editor）

题目：

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 program which, given the positions of the villages 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 first is the number of villages V, 1 <= V <= 300, and the second is the number of post offices P, 1 <= 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 X it holds that 1 <= X <= 10000.

输出：

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

样例输入：

10 5
1 2 3 6 7 9 11 22 44 50

复制

样例输出：

9

翻译：

描述：

有一条笔直的公路，沿着这条公路有一些村庄，这条公路代表一个整数轴，并且每个村庄的位置用一个整数坐标表示，没有两个村庄在相同的位置，两个位置之间的距离是它们整数坐标差的绝对值。

在这里将建一些邮局，但没必要所有的村庄都建，一个村庄和其中邮局的位置相同，建立邮局时，应选择其位置，以使每个村庄与其最近的邮局之间的所有距离总和最小。

你要编写一个程序，给出村庄的位置和邮局的数量，计算每个村庄和其最近的邮局的总距离可能的最小值。

输入：

你的程序要读入标准的输入，第一行包含两个整数：第一个数是村庄数V，1 <= V <= 300,第二个数是邮局数P1 <= P <= 30, P <= V.第二行包含V个升序的整数，这V个整数是村庄的位置，对于每个正数X，它认为1 <= X <= 10000。

输出：

第一行包含一个整数S，它是每个村庄与其最近的邮局之间所有距离的总和。