在一个划分成网格的操场上，n个士兵散乱地站在网格点上。网格点由整数坐标(x,y)表示。士兵们可以沿网格边上、下、左、右移动一步，但在同一时刻任一网格点上只能有一名士兵。按照军官的命令，士兵们要整齐地列成一个水平队列，即排列成(x,y),(x+1,y),…,(x+n-1,y)。如何选择x 和y的值才能使士兵们以最少的总移动步数排成一列。

实验任务：计算使所有士兵排成一行需要的最少移动步数。-In a grid divided into the playground, n soldiers stood scattered on the grid points. Grid point by the integer coordinates (x, y) express. Soldiers along the edge of the grid, down, left and right moving step, but at the same time any one grid point has only one soldier. In accordance with the officer s command, the soldiers should be neatly列成level queue, that is arranged in (x, y), (x+ 1, y), ..., (x+ N-1, y). How to choose x and y values to make the soldiers with the minimum of the total moves one line up. Experimental tasks: the calculation so that all the soldiers lined up his required minimum moves.