题库练习 Michael and Charging Stations
← 上一题 下一题 →

A11259 | Michael and Charging Stations

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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 $1000$ burles on charge if he goes to the first job, and $2000$ 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 $x$ burles, he is allowed to pay an amount of $y$ ( $0<=y<=x$ ) burles that does not exceed the bonus card balance with bonus burles. In this case he pays $x-y$ burles with cash, and the balance on the bonus card is decreased by $y$ bonus burles.

If customer pays whole price with cash (i.e., $y=0$ ) then 10% of price is returned back to the bonus card. This means that bonus card balance increases by ![](/uploads/acgo/image/546797e864f6cf59_4d50a5416006.jpeg) bonus burles. Initially the bonus card balance is equal to 0 bonus burles.

Michael has planned next $n$ 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 $n$ ( $1<=n<=300000$ ), the number of days Michael has planned.

Next line contains $n$ integers $a_{1},a_{2},...,a_{n}$ ( $a_{i}=1000$ or $a_{i}=2000$ ) with $a_{i}$ denoting the charging cost at the day $i$ .

输出格式

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
C++ 编辑器
输入
输出