1月28日小年训练赛B

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.
Examples
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

#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
struct node
{
	int t;
	int w;
}a[500000];//定义结构体
int cmp(node x,node y)//定义sort函数的比较条件
{
	return x.w<y.w;
}
int main()
{
	int n,t;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>a[i].t>>a[i].w;
	}
	sort(a,a+n,cmp);按结束时间排序
	int ans=1;
	t=a[0].w;
	for(int i=1;i<n;i++)
	{   
		if(a[i].t>t)
		{
			ans++;
			t=a[i].w;
		}
	}
    cout<<ans;
	return 0;
}