[C++] Min Heap <int>

https://leetcode.com/problems/meeting-rooms-ii/description/

LeetCode - The World's Leading Online Programming Learning Platform

class Solution {
public:
    int minMeetingRooms(vector<vector<int>>& intervals) {
        sort(intervals.begin(), intervals.end());
		priority_queue<int, vector<int>, greater<int>> pq;
		int ret = 0;
		for (vector<int>& interval : intervals) {
			int s = interval[0], e = interval[1];
			while (!pq.empty() and pq.top() <= s) {
				pq.pop();
			}
			pq.push(e);
			ret = max(ret, int(pq.size()));
		}
		return ret;
    }
};