#include<bits/stdc++.h>
//#define int long long
using namespace std;
struct node{
int x;
bool operator < (const node &a) const
{
return(a.x<x);
}
node(int a){x=a;}
};
signed main(){
priority_queue<node>qu;
qu.push(node(5));
qu.push(node(3));
qu.push(node(4));
while (!qu.empty()) {
auto m = qu.top();
qu.pop();
cout<<m.x;
}
}
优先队列以及结构体运算符的重载
最新推荐文章于 2024-07-25 21:13:04 发布