C++ STL 堆的相关操作

#include <iostream>
#include <string>
#include <vector>
#include <iterator>
#include <algorithm>
#include <list>
#include <set>
#include <cstdlib>
#include <functional>
#include <numeric>
using namespace std;

template<typename T>
void printVector(vector<T> v)
{
 vector<T>::iterator it;
 for(it=v.begin();it!=v.end();++it) //使用迭代器输出
  cout<<*it<<" ";
 cout<<endl;
}

//堆的相关操作
int main()
{
 int A[]={1,4,2,6,5,7,9};
 const int N=sizeof(A)/sizeof(int);

 make_heap(A,A+N);
 copy(A,A+N,ostream_iterator<int>(cout," "));
 cout<<endl;

//  sort_heap(A,A+N);
//  copy(A,A+N,ostream_iterator<int>(cout," "));
//  cout<<endl;

 int n=N;
 while(n>1)
 {
  copy(A,A+N,ostream_iterator<int>(cout," "));
  cout<<endl;
  pop_heap(A,A+n);
  --n;
 }
 copy(A,A+N,ostream_iterator<int>(cout," "));
  cout<<endl;

//  pop_heap(A,A+N); //删除堆内最大元素
//  copy(A,A+N-1,ostream_iterator<int>(cout," "));
//  cout<<endl;
//  cout<<A[N-1]<<endl;

 return 0;
}