cpp中优先级队列的自定义运算符

Question

使用自定义运算符声明这样的优先级队列时出错

struct compare1{
         bool operator()(Interval &s1,Interval &s2){
             if(s1.start!=s2.start)return s1.start<s2.start;
             return s1.end<s2.end;
         }
     };
priority_queue(Interval,vector<Interval>,compare1)p;

错误-

^/代码/解决方案。cpp:33:32:错误：在“，”令牌优先级_队列（间隔、向量、比较1）p之前应为主表达式；

^/代码/解决方案。cpp:33:49:错误：在“，”令牌优先级_队列（间隔、向量、比较1）p之前应为主表达式^

/code/Solution.cpp:33： 58：错误：预期的主表达式之前'）'令牌priority_queue（区间，向量，比较1）p；

我的全部密码

class Solution {
public:
    /**
     * @param intervals: an array of meeting time intervals
     * @return: the minimum number of conference rooms required
     * 
     */
     static bool compare(Interval s1 ,Interval s2){
         if(s1.start!=s2.start)return s1.start<s2.start;
         return s1.end<s2.end;
     }

     struct compare1{
         bool operator()(Interval &s1,Interval &s2){
             if(s1.start!=s2.start)return s1.start<s2.start;
             return s1.end<s2.end;
         }
     };
    int minMeetingRooms(vector<Interval> &intervals) {

        sort(intervals.begin(),intervals.end(),compare);
        priority_queue(Interval,vector<Interval>,compare1)p;
        p.push(intervals[0]);
        int ans = 0;
        for(int i=1;i<intervals.size();i++){
            Interval curr = interevals[i];
            Interval earliest = p.top();
            p.pop();


            if(earliest.end<curr.start){
                earliest.start = min(earliest.start,interevals[i].start);
                earliest.end = max(earliest.end,intervals[i].end);
                pq.push(earliest);
                ans++;
            }
            else{
                p.push(interevals[i]);
            }

        }
        return ans;


    }
};

Answer 1

用这个，

priority_queue<Interval,vector<Interval>,compare1> p;