两重“线段覆盖”问题

Recording the Moolympics

题目描述 ：
Being a fan of all cold-weather sports (especially those involving cows),Farmer John wants to record as much of the upcoming winter Moolympics as possible.
The television schedule for the Moolympics consists of N different programs (1 <= N <= 150), each with a designated starting time and ending time. FJ has a dual-tuner recorder that can record two programs simultaneously.
Please help him determine the maximum number of programs he can record in total.
输入 ：

• Line 1: The integer N.
• Lines 2…1+N: Each line contains the start and end time of a single program (integers in the range 0…1,000,000,000).
  输出
• Line 1: The maximum number of programs FJ can record.
  样例输入：
  6
  0 3
  6 7
  3 10
  1 5
  2 8
  1 9
  样例输出：
  4
  与线段覆盖问题一样，要把结束点早的放前面，不同的是，要有两个参数，同时开始记录（要同时开始记录，分开上下两次记录是要WA掉的，具体原因暂不明）。要注意，两次记录的标记前后顺序不能变，要是某一次变了，需要swap回来。

#include<bits/stdc++.h>
using namespace std;
typedef struct
{
    int a,b;
} STU;
bool cmp(STU x,STU y)
{
    if(x.b!=y.b)
        return x.b<y.b;
    else
        return x.a>y.a;
}
int main()
{
    int n;
    cin>>n;
    STU stu[n],stu1[n];
    for(int i=0; i<n; i++)
        cin>>stu[i].a>>stu[i].b;
    sort(stu,stu+n,cmp);
    int r=0,l=0,ans=0;
    for(int i=0; i<n; i++)
    {
        if(stu[i].a>=r)
            r=stu[i].b,ans++;
        else if(stu[i].a>=l)
            l=stu[i].b,ans++;
        if(r<l)
            swap(r,l);
    }
    cout<<ans<<endl;
    return 0;
}