Dutor

/*
template < class T, class Container = vector<T>,
           class Compare = less<typename Container::value_type> > class priority_queue;
 
explicit priority_queue ( const Compare& x = Compare(),
                          const Container& y = Container() );
template <class InputIterator>
         priority_queue ( InputIterator first, InputIterator last,
                          const Compare& x = Compare(),
                          const Container& y = Container() );
*/
#include <iostream>
#include <queue>
using namespace std;
 
struct Max_Heap
{
    Max_Heap(int n): _n(n) {}
    operator int() { return _n;} //在需要的地方隐式类型转换
    int _n;
};
 
struct Min_Heap
{
    Min_Heap(int n): _n(n) {}
    operator int() { return _n;} //在需要的地方隐式类型转换
    int _n;
};
bool operator < (Max_Heap l, Max_Heap r) //~ 正常的<
{
    return l._n < r._n;
}
 
bool operator < (Min_Heap l, Min_Heap r) //~ 反义的<
{
    return l._n > r._n;
}
 
int
main (int argc, char **argv)
{
    priority_queue<Min_Heap> heap; //~ 最小堆
    //priority_queue<Max_Heap> heap; //~ 最大堆
    //~ 测试用例
    //~ 前K个最大值
    int k = 5;
    int tmp;
    for (int i = 0; i < k; ++i)
    {
        cin>>tmp;
        heap.push(tmp);
    }
    while (cin>>tmp)
    {
        if(tmp > heap.top()._n)
        {
            heap.push(tmp);
            heap.pop();
        }
    }
    cin.clear();
    while (heap.size())
    {
        cout<<heap.top()._n<<' ';
        heap.pop();
    }
    return 0;
}