priority_queue<ListNode*,vector<ListNode*>,cmp> Q;//没有括号
struct cmp
{
bool operator()(ListNode* &t1,ListNode* &t2)
{
return t1->val<t2->val;//,大顶堆
}
};
struct cmp
{
bool operator()(Node &n1,Node &n2)
{
return n1.X<n2.X;//递增
}
};
sort(v.begin(),v.end(),cmp());//有括号