题目来源：http://noi.openjudge.cn/ch0206/162/
重点词汇：
axis：n,轴；
coordinate：n.坐标，v.协调，配合；
standard ：adj.标准的；
162:Post Office
- 总时间限制:
- 1000ms
- 内存限制:
- 65536kB
- 描述
- 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.
- 你的程序是从标准输入中读取的。 第一行包含两个整数：第一行是村庄的数量 V，1 <= V <= 300，第二行是邮局的数量 P，1 <= P <= 30，P <= V。 第二行包含 V 个递增顺序的整数。 这些 V 整数是村庄的位置。 对于每个位置 X，它认为 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.
- 这第一行包括一个整数 S ，表示每个村庄与其最近的邮局之间距离的总和。
- 样例输入
-
10 5 1 2 3 6 7 9 11 22 44 50
- 样例输出
-
9
- 来源
- IOI 2000