zoukankan      html  css  js  c++  java
  • Round #336 A. Saitama Destroys Hotel(Div.2)

    Saitama accidentally destroyed a hotel again. To repay the hotel company, Genos has volunteered to operate an elevator in one of its other hotels. The elevator is special — it starts on the top floor, can only move down, and has infinite capacity. Floors are numbered from 0 to s and elevator initially starts on floor s at time 0.

    The elevator takes exactly 1 second to move down exactly 1 floor and negligible time to pick up passengers. Genos is given a list detailing when and on which floor passengers arrive. Please determine how long in seconds it will take Genos to bring all passengers to floor 0.

    Input

    The first line of input contains two integers n and s (1 ≤ n ≤ 100, 1 ≤ s ≤ 1000) — the number of passengers and the number of the top floor respectively.

    The next n lines each contain two space-separated integers fi and ti (1 ≤ fi ≤ s,1 ≤ ti ≤ 1000) — the floor and the time of arrival in seconds for the passenger number i.

    Output

    Print a single integer — the minimum amount of time in seconds needed to bring all the passengers to floor 0.

    Examples
    input
    3 7
    2 1
    3 8
    5 2
    output
    11
    input
    5 10
    2 77
    3 33
    8 21
    9 12
    10 64
    output
    79
    Note

    In the first sample, it takes at least 11 seconds to bring all passengers to floor 0. Here is how this could be done:

    1. Move to floor 5: takes 2 seconds.

    2. Pick up passenger 3.

    3. Move to floor 3: takes 2 seconds.

    4. Wait for passenger 2 to arrive: takes 4 seconds.

    5. Pick up passenger 2.

    6. Go to floor 2: takes 1 second.

    7. Pick up passenger 1.

    8. Go to floor 0: takes 2 seconds.

    This gives a total of 2 + 2 + 4 + 1 + 2 = 11 seconds.

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 #define MAXN 1005
     4 int a[MAXN];
     5 
     6 int main()
     7 {
     8     int n,s;scanf("%d%d",&n,&s);
     9     for(int i=1;i<=n;i++)
    10     {
    11         int x,t;scanf("%d%d",&x,&t);
    12         a[x]=max(t,a[x]);
    13     }
    14     int x,y;
    15     int ans=0;
    16     for(int i=s;i>=0;i--)
    17     {
    18         ans = max(ans,a[i]);
    19         ans++;
    20     }
    21     cout<<ans-1<<endl;
    22 }
  • 相关阅读:
    10. 正则表达式匹配
    124. 二叉树中的最大路径和。 递归
    1028. 从先序遍历还原二叉树。 深搜
    1014. 最佳观光组合. 转变思路
    297. 二叉树的序列化与反序列化.
    1300. 转变数组后最接近目标值的数组和. 二分
    15. 三数之和. 双指针法⭐
    1. 两数之和. 哈希表
    739. Daily Temperatures. 单调栈
    面试题46. 把数字翻译成字符串. 递归
  • 原文地址:https://www.cnblogs.com/z-712/p/7323970.html
Copyright © 2011-2022 走看看