Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises)
D
Michael and Charging Stations
Codeforces
2400
原题
← CE →
翻译中…

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 image 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.

翻译中…

Input

翻译中…

The first line of input contains a single integer $*n*$ ($1 ≤ *n* ≤ 300 000$), 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

翻译中…

Output the minimum amount of burles Michael has to spend.

翻译中…

Note

翻译中…

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.

翻译中…

样例

Input #1
3
1000 2000 1000
Output #1
3700
InputCopy OutputCopy
Input #2
6
2000 2000 2000 2000 2000 1000
Output #2
10000
InputCopy OutputCopy
题目信息
题号
853D
时间限制
2 s
内存限制
512 MB
标签
二分
动态规划
贪心

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。