#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1000 + 10;
struct node{
int s,t;
}a[maxn];
int n;
bool cmp(node a,node b){
return a.t<b.t;
}
int solve(){
sort(a+1,a+n+1,cmp);
int sum = 1, cur = a[1].t; //已经选了第一个区间
for(int i = 2;i<=n;i++){
if(cur<=a[i].s){
cur = a[i].t;
sum++;
}
}
return sum;
}
int main()
{
cin>>n;
for(int i = 1;i<=n;i++)
cin>>a[i].s>>a[i].t;
cout<<solve()<<endl;
return 0;
}
选择不相交区间
最新推荐文章于 2020-10-07 22:36:48 发布