Timus 1787. Turn for MEGA 题解

2024-04-07 04:41:06

A traffic light at the turn for the “MEGA” shopping center from the Novomoskovskiy highway works in such a way that k cars are able to take a turn in one minute. At weekends all the residents of the city drive to the mall to take a shopping, which results in a huge traffic jam at the turn. Administration of the mall ordered to install a camera at the nearby bridge, which is able to calculate the number of cars approaching this turn from the city. The observation started n minutes ago. You should use the data from the camera to determine the number of cars currently standing in the traffic jam.

Input

The first line contains integers k and n (1 ≤ k, n ≤ 100), which are the number of cars that can take a turn to “MEGA” in one minute and the number of minutes passed from the beginning of observation. The second line contains space-separated integers a1, …, an (0 ≤ ai ≤ 100), where aiis the number of cars that approached the turn during the i-th minute. The observation started at morning, when there were no cars at the turn.

Output

Output the number of cars currently standing in the traffic jam.

Samples

input	output
5 3 6 7 2	0
5 3 20 0 0	5

注意：

1 每分钟只能通过k车了，如果不足k车，那么本分钟内也不会通过超过k车了

#include <iostream>
using namespace std;void TurnForMEGA()
{int k = 0, n = 0, a = 0, left = 0;cin>>k>>n;   for (int i = 0; i < n; i++){cin>>a;left = a + left - k;if (left < 0) left = 0;}cout<<left<<endl;
}

Timus 1787. Turn for MEGA 题解相关推荐

BZOJ 1787 [Ahoi2008]Meet紧急集合题解与分析
[Ahoi2008]Meet 紧急集合 Time Limit: 20 Sec Memory Limit: 162 MB Description Input Output Sample Input ...
java 合并和拆分单元格_如何轻松合并和拆分电子书
java 合并和拆分单元格 Whether you want to merge collections of short stories into a DIY anthology, or you wa ...
SCU 4445 Right turn（dfs）题解
思路:离散化之后,直接模拟就行,标记vis开三维代码: #include<iostream> #include<algorithm> #include<cstdio&g ...
HDU 4869 Turn the pokers（思维+组合公式+高速幂）
Turn the pokers 大意:给出n次操作,给出m个扑克.然后给出n个操作的个数a[i],每一个a[i]代表能够翻的扑克的个数,求最后可能出现的扑克的组合情况. Hint Sample Inp ...
2017 ACM ICPC Asia Shenyang Regional Contest 题解（10 / 13）【每日亿题2 / 16】
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划目录 A.(2017 ICPC shenyang I)Little Boxes B.(2017 ICP ...
英语单词 voltage simulation synthesize junction asynchronous mega optimize
voltage 英 [ˈvəʊltɪdʒ]美 [ˈvoʊltɪdʒ] n. 电压;伏特数 [例句] The output voltage rises, compensating for the ori ...
HDU 4869 Turn the pokers（思维+组合公式+快速幂）
Turn the pokers 大意:给出n次操作,给出m个扑克,然后给出n个操作的个数a[i],每个a[i]代表可以翻的扑克的个数,求最后可能出现的扑克的组合情况. Hint Sample Inpu ...
1787: [Ahoi2008]Meet 紧急集合
1787: [Ahoi2008]Meet 紧急集合 Time Limit: 20 Sec Memory Limit: 162 MB Submit: 1482 Solved: 652 [Submit ...
hdu 2438 Turn the corner [ 三分 ]
传送门 Turn the corner Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Othe ...
【NOIP2018】旅行 (洛谷P5049 / P5022) O(nlogn)题解
阅读和学习本篇题解前,你应该掌握: C++ STL stack.vector.queue.pair的基本用法: 递归.搜索和贪心思想. 洛谷传送门 P5049 此题可以先从数据范围入手,观察m的范围( ...

最新文章

热门文章