Post Office 1.22

Post Office | JXNUOJ

描述：

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, 第二个整数是邮局的数量P, 1 <= P <= 30, P <= V. 第二行是逐渐增大的V个整数. 这V个整数代表了村庄的位置. 每一个位置X ， 1 <= X <= 10000.

输出：

一行输出S, 表示所有村庄和它最近邮局的距离最小可能之和.

样例输入：

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

样例输出：

9