Restaurant

- Restaurant

Time Limit:4000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit

Status
Description
A restaurant received n orders for the rental. Each rental order reserve the restaurant for a continuous period of time, the i-th order is characterized by two time values — the start time li and the finish time ri (li ≤ ri).

Restaurant management can accept and reject orders. What is the maximal number of orders the restaurant can accept?

No two accepted orders can intersect, i.e. they can’t share even a moment of time. If one order ends in the moment other starts, they can’t be accepted both.

Input
The first line contains integer number n (1 ≤ n ≤ 5·105) — number of orders. The following n lines contain integer values li and ri each (1 ≤ li ≤ ri ≤ 109).

Output
Print the maximal number of orders that can be accepted.

Sample Input
Input
2
7 11
4 7
Output
1
Input
5
1 2
2 3
3 4
4 5
5 6
Output
3
Input
6
4 8
1 5
4 7
2 5
1 3
6 8
Output
2
————————————————————————————————————————
和今年暑假不AC 一样，特别简单一道题，就是RUNTIME 不知道为什么，先存着。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct time{
    __int64 start;
    __int64 end;
}a[500000];

bool cmp( time x,time y)
{
    return x.end <= y.end;
}
int main()
{
    __int64 t,i,k,count;
    while( ~scanf("%I64d",&t)&&t )
    {
        count=0;
        k=0;
        for( i=0; i<t; i++ )
        {
            scanf("%I64d%I64d",&a[i].start,&a[i].end);
        }
        sort(a,a+t,cmp);
        for( i=0; i<t; i++ )
        {
            if( a[i].start > k )
            { 
                count++;
                k=a[i].end; 
            }
        }
        printf("%I64d\n",count);
    }
    return 0;
}