Restaurant--贪心

最新推荐文章于 2022-11-25 18:44:38 发布

原创最新推荐文章于 2022-11-25 18:44:38 发布 · 366 阅读

0 ·

CC 4.0 BY-SA版权

国外的oj（包括Register等）专栏收录该内容

10 篇文章

订阅专栏

本文探讨了一个关于餐厅接收预订订单的问题，通过贪心算法来确定可以接受的最大订单数量，确保没有两个订单在同一时间段内冲突。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

一个关于老板想赚更多钱的问题。
贪心算法。
Restaurant
Time Limit:4000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

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

运用到贪心算法，首先将结束时间排序，前一个的结束时间<后一个的开始时间。
代码如下：

#include <cstdio>
#include <algorithm>
using namespace std;
struct n
{
    int str,end;
}d[500000+11];
bool cmp(n a,n b)
{
    return a.end < b.end;
}
int main()
{
    int t;
    while(~scanf("%d",&t))
    {
        for (int i=0;i<t;i++)
            scanf ("%d %d",&d[i].str,&d[i].end);
        sort(d,d+t,cmp);
        int pos=0;
        int ans=1;
        for (int i=1;i<t;i++)
        {
            if (d[i].str>d[pos].end)
            {
                pos=i;
                ans++;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}