AcWing 3818. 餐厅
原题链接
简单
作者:
lyf11
,
2021-08-27 22:09:07
,
所有人可见
,
阅读 314
样例
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 500010;
int n;
struct Order
{
int l, r;
bool operator< (const Order& t) const
{
return r < t.r;
}
}order[N];
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i ++ )
scanf("%d%d", &order[i].l, &order[i].r);
sort(order, order + n);
int res = 0, last = 0;
for (int i = 0; i < n; i ++ )
if (order[i].l > last)
{
res ++ ;
last = order[i].r;
}
printf("%d\n", res);
return 0;
}