求出sliding window的最大最小值-n array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves ri

读取STL格式文件代码，通过建表简化拓扑结构，获取模型的最大值，最小值等参数。-STL format file to read the code, through the construction of simplified topology table, access to model maximum and minimum values ??and other parameters.

利用堆排序的思想，使用C++模板类，对数组进行排序，输出最大或最小的k个数。-The use of heap sort of thinking, using C++ template class, sort the array, the output of the maximum or minimum number of k.