Gold Rush | 프로그래밍의 벗 PivotOJ
PivotOJ

Gold Rush

시간 제한: 2000ms메모리 제한: 512MB출처: ICPC Asia Tehran Regional Contest 2019BOJ 18331

문제

Again, Neverland has experienced a very bad economic condition over the past few months. The value of Oshloob, the national currency of Neverland, changes against one unit of gold very rapidly. People in Neverland, all wondering about their savings, are trying to exchange their savings with gold coins.

Dr. Predictman who is a data scientist, has obtained a prediction of the price (in Oshloobs) of a gold coin for the next n days based on the existing data over the past 40 years. He believes his prediction, and now he want to increase his savings based on it. He was wondering how much savings he has at the end of the n-th day assuming that he has c Oshloobs at the beginning of the first day. Since Dr. Predictman is not a programmer, he asks you to help to find his answer.

입력

The first line of the input contains two integers c (0 ⩽ c ⩽ 3000), Dr. Predictman’s initial savings in Oshloobs, and n (0 ⩽ n ⩽ 30), the period of his prediction. Each of the next following n lines contains an integer pi (1000 ⩽ pi ⩽ 2000) denoting the price of a gold coin at day i (1 ⩽ i ⩽ n) in Oshloobs.

출력

The output contains just an integer, which indicates the maximum savings he can obtain at the end of the n-th day assuming that Dr. Predictman exchanges all his remaining gold coins (if there is any) to Oshloobs at the end of the n-th day.

예제

예제 1

입력
1000 3
1000
1100
1200
출력
1200

예제 2

입력
2000 4
1000
2000
1500
1800
출력
4600
코드를 제출하려면 로그인하세요.