#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
typedef struct
{
int s,e;
}Node;
struct cmp
{
bool operator()(const Node &t1,const Node &t2)
{
return t1.s>t2.s;
}
};
priority_queue<Node,vector<Node>,cmp>Q;
结构体优先队列
最新推荐文章于 2024-07-25 21:26:38 发布