点击题目打开链接
Restaurant
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.
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).
Print the maximal number of orders that can be accepted.
2 7 11 4 7
1
5 1 2 2 3 3 4 4 5 5 6
3
6 4 8 1 5 4 7 2 5 1 3 6 8
2
下面是我的代码：
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
using namespace std;
struct P
{int star;int endd;
}num[900000];
bool cmp(P a,P b)
{return a.endd<b.endd;
}
int main()
{int n,k,p;while(scanf("%d",&n)!=EOF){k=1;for(int i=0;i<n;i++){scanf("%d%d",&num[i].star,&num[i].endd);}sort(num,num+n,cmp);p=num[0].endd;for(int i=1;i<n;i++){if(num[i].star>p){k++;p=num[i].endd;}}printf("%d\n",k);}return 0;
}