priority_queue<int,vector<int>,greater<int>>
是 最小值的优先队列,top() 是当前优先队列的最小值。
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n;
struct Range{
int l, r;
bool operator < (const Range &W)const{
return l < W.l;
}
}range[N];
int main(){
cin >> n;
for(int i = 0; i < n; i ++ ){
cin >> range[i].l >> range[i].r;
}
sort(range, range + n);
priority_queue<int, vector<int>, greater<int>> heap;
for(int i = 0; i < n; i ++ ){
if(heap.empty() || heap.top() >= range[i].l){
heap.push(range[i].r);
}
else{
heap.pop();
heap.push(range[i].r);
}
}
cout << heap.size() << endl;
return 0;
}