CF853D.Michael and Charging Stations

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Michael has just bought a new electric car for moving across city. Michael does not like to overwork, so each day he drives to only one of two his jobs.

Michael's day starts from charging his electric car for getting to the work and back. He spends 10001000 burles on charge if he goes to the first job, and 20002000 burles if he goes to the second job.

On a charging station he uses there is a loyalty program that involves bonus cards. Bonus card may have some non-negative amount of bonus burles. Each time customer is going to buy something for the price of xx burles, he is allowed to pay an amount of yy ( 0<=y<=x0<=y<=x ) burles that does not exceed the bonus card balance with bonus burles. In this case he pays xyx-y burles with cash, and the balance on the bonus card is decreased by yy bonus burles.

If customer pays whole price with cash (i.e., y=0y=0 ) then 10% of price is returned back to the bonus card. This means that bonus card balance increases by bonus burles. Initially the bonus card balance is equal to 0 bonus burles.

Michael has planned next nn days and he knows how much does the charge cost on each of those days. Help Michael determine the minimum amount of burles in cash he has to spend with optimal use of bonus card. Assume that Michael is able to cover any part of the price with cash in any day. It is not necessary to spend all bonus burles at the end of the given period.

输入格式

The first line of input contains a single integer nn ( 1<=n<=3000001<=n<=300000 ), the number of days Michael has planned.

Next line contains nn integers a1,a2,...,ana_{1},a_{2},...,a_{n} ( ai=1000a_{i}=1000 or ai=2000a_{i}=2000 ) with aia_{i} denoting the charging cost at the day ii .

输出格式

Output the minimum amount of burles Michael has to spend.

输入输出样例

  • 输入#1

    3
    1000 2000 1000
    

    输出#1

    3700
    
  • 输入#2

    6
    2000 2000 2000 2000 2000 1000
    

    输出#2

    10000
    

说明/提示

In the first sample case the most optimal way for Michael is to pay for the first two days spending 3000 burles and get 300 bonus burles as return. After that he is able to pay only 700 burles for the third days, covering the rest of the price with bonus burles.

In the second sample case the most optimal way for Michael is to pay the whole price for the first five days, getting 1000 bonus burles as return and being able to use them on the last day without paying anything in cash.

首页