zoukankan      html  css  js  c++  java
  • Codeforces 608 A. Saitama Destroys Hotel

     
     
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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.

    题意就是电梯接乘客,这个电梯只能从上往下走,给的数据是在第几层有乘客,乘客到达该层的时间,乘客上电梯的时间忽略不计,要求输出花费的最短时间是多少。

    我的理解就是单独把某层的时间拿出来算一下,从该层到最底层花的时间+等待乘客的时间和总的层数花的时间比较一下,找出max,然后其他层也是这样,和上一组楼层的max比较一下。其实总的想一下,就是把楼层数+等待乘客的时间找出max,然后和总的楼层数比较一下就可以了。(最近好多题都用到这种思想了,不知道这种思想叫啥,但是感觉有时候挺好用的,就是有时用这种思路写题会T,超时了耶。。。)

    代码:

    #include<bits/stdc++.h>
    using namespace std;
    int main(){
        int n,m,f,t;
        int maxx=-1;
        while(~scanf("%d%d",&n,&m)){
            for(int i=0;i<n;i++){
                scanf("%d%d",&f,&t);
                if(f+t>maxx)
                maxx=max(f+t,maxx);
            }
            if(maxx<m)
                printf("%d
    ",m);
            else
                printf("%d
    ",maxx);
        }
        return 0;
    }
     
  • 相关阅读:
    团体程序设计天梯赛-练习集L1-002. 打印沙漏
    WUOJ-ACM :1003: 零起点学算法78——牛牛
    ZOJ-2965
    天梯赛-L1-018. 大笨钟
    代码哲学 摒弃“够用就行”的心态
    github 源码阅读
    Biopython SeqIO 读取序列文件,读取信息,写入序列
    Biopython 模块处理Seq序列 方法
    coursera 有比较丰富的生物信息等课程 win7 访问设置
    python 正则匹配 csv文件中特殊符号如■高风险 这样的black block
  • 原文地址:https://www.cnblogs.com/ZERO-/p/7128827.html
Copyright © 2011-2022 走看看