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 每分鐘只能通過(guò)k車了，如果不足k車，那么本分鐘內(nèi)也不會(huì)通過(guò)超過(guò)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; }

總結(jié)

以上是生活随笔為你收集整理的Timus 1787. Turn for MEGA 题解的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。