洛谷 1803 凌乱的yyy 贪心

题目：
https://www.luogu.org/problem/show?pid=1803

一年前的坑，填一下；

思路：线段覆盖一；

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int MAXN=1000001+213;
int n,Y,ans;
struct hh
{
    int x,y;
}a[MAXN];
bool cmp (hh a,hh b)
{
    return a.y<b.y;
}
void solve()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        scanf("%d%d",&a[i].x,&a[i].y);

    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=n;i++)
        if(a[i].x>=Y) ans++,Y=a[i].y;

    cout<<ans;
}     

int main()
{
    solve();
    return 0;
}