std::priority_queue 报错Expression invalid comparator

最近想用优先级队列解决进队列的结构体按等级排序并出列的需求，但是总是报错

是重写的排序function报错，我的代码是这样的

struct Model
{
	int a = 6;
    Model(int a_):a(a_){}
};

struct Node {
	int priority_;
	Model data_;
    Node(int pri, Model data):priority(pri, data){}
};


class complex {
public:
	bool operator()(const Node& s1, const Node& s2)
	{
		return s1.priority_ >= s2.priority_;
	}
};


class custom_priority_queue : public std::priority_queue<Node, std::vector<Node>, complex>
{
public:
    bool midRemove(const QString& value) {
        for(auto it = this->c.begin(); it != this->c.end(); it++)
        {
            if(it->data_.a == value)
            {
                this->c.erase(it);
                std::sort_heap(this->c.begin(), this->c.end(), this->comp);
                return true;
            }
        }
        return false;
    }
};

int main()
{
    custom_priority_queue  queue_;
    queue.push(Node(1, Model(2)));
    queue.push(Node(9, Model(2)));
    queue.push(Node(4, Model(2)));
    queue.push(Node(2, Model(2)));
    queue.push(Node(7, Model(2)));
    queue.push(Node(1, Model(2)));
    queue.push(Node(2, Model(2)));
    while (!queue_.empty())
	{
		std::cout << queue_.top().priority_ << " ";
		queue_.pop();
	}

经查下面重写比较器的时候,要遵循结果对称。例如complex(1,2) 如果是true，那么complex(2,1)就必须式false，或者同为false。

上面的写法中:error

complex（1，1）为true

complex（1，1）为true

修改为下面的写法后：

complex（1，1）为false

complex（1，1）为false

before:
class complex {
public:
	bool operator()(const Node& s1, const Node& s2)
	{
		return s1.priority_ >= s2.priority_;
	}
};
after:
class complex {
public:
	bool operator()(const Node& s1, const Node& s2)
	{
		if (s1.priority_ > s2.priority_)
			return true;
		return false;
	}
};