시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 (추가 시간 없음) | 1024 MB | 402 | 58 | 49 | 18.919% |
You are given an array $A_{0}$, $A_{1}$, $A_{2}$, $...$ , $A_{N-1}$ of $N$ positive integers. Also, you are given an positive integer $K$. Your task is to find the largest positive integer $M$ such that the following condition is satisfied:
The first line contains two integers, $N$ and $K$. The second line contains $N$ integers, the array $A$ given in order.
Output a single positive integer denoting the largest possible $M$. If there is no such $M$, output $0$.
This subtask has an additional constraint:
This subtask has an additional constraint:
This subtask has no additional constraints.
10 10 3 7 4 3 1 3 5 2 5 1
2