优先队列以及结构体运算符的重载

#include
//#define int long long
using namespace std;
struct node{
    int x;
    bool operator < (const node &a) const
    {
        return(a.xqu;
    qu.push(node(5));
    qu.push(node(3));
    qu.push(node(4));
    while (!qu.empty()) {
        auto m = qu.top();
        qu.pop();
        cout<