Codeforces Round #336 (Div. 2)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 from0 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 ≤ 1001 ≤ 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 ≤ s1 ≤ 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.

Sample test(s)
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
          
          
           
           
#include
           
           
            
            
#include
            
            
             
             
#include
             
             
              
              
#include
              
              
                #include 
                #include 
                
                  using namespace std; const int N = 1001; struct node { int f;//楼层数 int t;//等电梯的时间 }a[N]; int main(void) { int n, s; while(cin >>n >> s) { int i; for(i = 0; i < n; i++) { scanf("%d%d", &a[i].f, &a[i].t); } int time = 0; int tmp = s; for(i = 0; i < n; i++) { time += tmp - a[i].f; if(time < a[i].t) time = a[i].t; tmp = a[i].f; } if(tmp) { time += tmp; } printf("%d\n", time); } return 0; } 
                 
              
             
             
            
            
           
           
          
          

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值