自己封装的优先队列，堆实现

#include 
#include 
#include 
#include 
#define MAX_H nodes1
#define MIN_H nodes2
#define LL long long

using namespace std;

struct nodes1
{
    LL k;
    bool operator <(const nodes1 &b) const
    {
        return k  b.k;
    }
};


template 
class Que
{
public:
    Que()
    {
        len = 0;
    }

    int len;
    TYPE num[30005];

    void adjust_d(TYPE num[], int cur, int n)
    {
        int i = cur,j = i*2+1;
        //printf("ij: %d %d\n", i, j);
        //printf("%d\n",n);
        while(j = 0)
        {
            if(num[j] Q_max; //大顶堆
    Que Q_min; //小顶堆
}

自己封装的优先队列，堆实现