0分求调
查看原帖
0分求调
1392170
kbl_LMC楼主2024/12/26 20:18
#include <bits/stdc++.h>
using namespace std;
struct ac{
	int l;
	int r;
}zs[1000001];
bool cmp(ac a,ac b){
	return a.r<b.r;
}
int main() {
	int n,s=0,m;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>zs[i].l>>zs[i].r;
	}
    sort(zs+1,zs+n+1,cmp);
	m=zs[1].r;
	int j=1;
	while(j<=n){
		j++;
		if(zs[j].l>m){
			s++;
            m=zs[j].r;
		}
	}
	cout<<s;
	return 0;
}
2024/12/26 20:18
加载中...