在一个划分成网格的操场上，n个士兵散乱地站在网格点上。网格点由整数坐标(x,y)表示。士兵们可以沿网格边上、下、左、右移动一步，但在同一时刻任一网格点上只能有一名士兵。按照军官的命令，士兵们要整齐地列成一个水平队列，即排列成 (x,y),(x+1,y),…,(x+n-1,y)。如何选择x 和y的值才能使士兵们以最少的总移动步数排成一列。计算使所有士兵排成一行需要的最少移动步数。-N soldiers scattered standing on a playground is divided into a grid, the grid points. The grid points represented by the integer coordinates (x, y). Soldiers along the edge of the grid, down, left, right step, but at the same time on any grid point can only be a soldier. In accordance with the command of the officers, soldiers to neatly fitted to a horizontal queue, i.e. arranged in the (x, y) of (x+1, y), ..., (x+n-1, y). How to choose the values ​ ​ of x and y to the soldiers arranged in a minimum total number of moves. Calculated so that all the soldiers lined up his party needs the least number of moves.