在一个划分成网格的操场上，n个士兵散乱地站在网格点上。网格点由整数坐标(x,y)表

示。士兵们可以沿网格边上、下、左、右移动一步，但在同一时刻任一网格点上只能有一名

士兵。按照军官的命令，士兵们要整齐地列成一个水平队列，即排列成

(x,y),(x+1,y),…,(x+n-1,y)。如何选择x 和y的值才能使士兵们以最少的总移动步数排成一列。-A playground is divided into a grid of n soldiers stood scattered on the grid points. Grid points by integer coordinates (x, y). Soldiers along the grid the edge, down, left, and right step, but only one soldier at the same time any one grid point. In accordance with the commands of officers, soldiers to be neatly fitted to a level queue, ie, arranged in the (x, y), (x+1, y), ..., (x+n-1, y). How to select the x and y values ​ ​ to make the soldiers arranged in a minimum of the total number of moves.