程序解决了给定油井位置，求出一条东西向输油管道的位置，使之到各个油井的距离之和达到最小

//程序一次性读入11组测试文件，将油井纵坐标存储在动态开辟的pipey数组里，通过运用在数组中查找第K小个元素的算法找到了管道的最优位置

//最后求得最短距离后，将最终结果一次性存储到11个输出文件中。-Program to solve a given oil well location, find a location east-west pipeline, so that the distance to each well and achieve the minimum// process into 11 groups of one-time reading test file, will store well in a dynamic open up the vertical axis of pipey array, through the use of the array to find the first K elements of the algorithm for small to find the optimal location of pipeline// Lastly, after the shortest distance obtained, once the final results will be stored in the output file 11.