Codeforces 845 C Two TVs

参考：https://blog.csdn.net/xjh_shin/article/details/77491693

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int n;
const int N=2*1e5+5;
struct node
{
    int s,e;//s为开始时间，e为结束时间
}no[N];
int cmp(struct node x,struct node y)//应该先按开始时间排序，再按结束时间排序！
{
    if (x.s==y.s)
    {
        return x.e<y.e;
    }
    return x.s<y.s;
}
void test()
{
    for (int i=0;i<n;i++)
    {
        printf("%d %d
",no[i].s,no[i].e);
    }
    getchar();
}
int main()
{
//    freopen("btext.txt","r",stdin);
    while (cin>>n)
    {
        for (int i=0;i<n;i++)
        {
            cin>>no[i].s>>no[i].e;
        }
        if (n<3)
        {
            cout<<"YES"<<endl;
            continue;
        }
        sort(no,no+n,cmp);
//        test();//提交前要记得注释测试语句！
        int flag,ta,tb;
        ta=no[0].e;
        tb=no[1].e;
        flag=2;//已看的节目数量
        for (int i=2;i<n;i++)
        {
            if (ta<no[i].s)
            {
                flag++;
                if (flag==n)
                {
                    cout<<"YES"<<endl;
                    break;
                }
                ta=no[i].e;
                continue;
            }
            if (tb<no[i].s)
            {
                flag++;
                if (flag==n)
                {
                    cout<<"YES"<<endl;
                    break;
                }
                tb=no[i].e;
                continue;
            }
            cout<<"NO"<<endl;
            break;
        }
    }

    return 0;
}