Restaurant
time limit per test 4 seconds
memory limit per test 256 megabytes
input standard input
output standard output
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
inputCopy
2
7 11
4 7
outputCopy
1
inputCopy
5
1 2
2 3
3 4
4 5
5 6
outputCopy
3
inputCopy
6
4 8
1 5
4 7
2 5
1 3
6 8
outputCopy
2
问题描述
给出订单数n,以及n个订单的起始时间和结束时间,限制条件是:两份订单不能同时进行。要求输出最大能够接的订单数。
问题分析
贪心算法。贪心策略是让结束的时间早的先选,因为起始时间早的订单可能持续时间长;持续时间短的订单可能起始时间晚,以结束时间早的策略可以解决这个问题。
代码如下
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
const int N=(int)5e5+5;
struct node{
int start,end;
}a[N];
bool cmp(node&obj1,node&obj2){
if(obj1.end<obj2.end) return 1;
//if(obj1.end==obj2.end&&obj1.start<=obj2.start) return 1;
/*开始时间不重要,结束时间相同的条件下,如果是让开始时间前的变量排在前面,那么选择的时候会先被添加或是被筛掉;
如果是开始时间前的变量排在后面,那么后被添加进去或是添加另一个变量而不是这个变量,
但找下一个的时候是以上一个被选择的变量的结束为判断标准的,所以开始时间不重要
*/
return 0;
}
int main()
{
int n,i,count,end;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %d",&a[i].start,&a[i].end);
sort(a,a+n,cmp);
end=a[0].end;
count=1;
for(i=1;i<n;i++)
{
if(a[i].start>end){
end=a[i].end;
count++;
}
}
printf("%d\n",count);
return 0;
}