活动安排问题

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>

using namespace std;

const int maxn = 10000 + 1;

typedef struct
{
    int start;
    int over;
}point;

point p[maxn];

const int cmp(const  point a, const  point b)
{
    return a.over <= b.over;
}

int main()
{
    int n;
    while (cin >> n)
    {
        memset(p, 0, sizeof(p));
        for (int i = 0;i<n;i++)
            cin >> p[i].start >> p[i].over;
        sort(p, p + n, cmp);
        int cnt = 1;
        for (int i = 0;i<n;i++)
        {
            for (int j = i + 1;j<n;j++)
            {
                if (p[i].over <= p[j].start)
                {
                    i = j;
                    cnt++;
                    continue;
                }
            }
        }
        cout << cnt << endl;
    }
    return 0;
}