2406. Divide Intervals Into Minimum Number of Groups

class Solution {
public:
    int minGroups(vector<vector<int>>& intervals) {
        sort(intervals.begin(),intervals.end());
        priority_queue<int,vector<int>,greater<int>>pq;
        for (const auto& interval : intervals){
            int start = interval[0], end = interval[1];
            if(!pq.empty() && pq.top()<start){
                pq.pop();
            }
            pq.push(end);
        }
        return pq.size();
    }
};