STL源碼剖析之算法：sort_heap

template <class RandomAccessIterator>
void sort_heap(RandomAccessIterator first, RandomAccessIterator last) {
    while(last - first > 1)
        pop_heap(first, last--);
}

注：pop_heap源碼請見http://zxn990.blog.51cto.com/4253193/1165524