{"raw_statement":[{"iden":"problem statement","content":"We have $N$ logs of lengths $A_1,A_2,\\cdots A_N$.\nWe can cut these logs at most $K$ times in total. When a log of length $L$ is cut at a point whose distance from an end of the log is $t$ $(0<t<L)$, it becomes two logs of lengths $t$ and $L-t$.\nFind the shortest possible length of the longest log after at most $K$ cuts, and print it after rounding up to an integer."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $0 \\leq K \\leq 10^9$\n*   $1 \\leq A_i \\leq 10^9$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$\n$A_1$ $A_2$ $\\cdots$ $A_N$"},{"iden":"sample input 1","content":"2 3\n7 9"},{"iden":"sample output 1","content":"4\n\n*   First, we will cut the log of length $7$ at a point whose distance from an end of the log is $3.5$, resulting in two logs of length $3.5$ each.\n*   Next, we will cut the log of length $9$ at a point whose distance from an end of the log is $3$, resulting in two logs of length $3$ and $6$.\n*   Lastly, we will cut the log of length $6$ at a point whose distance from an end of the log is $3.3$, resulting in two logs of length $3.3$ and $2.7$.\n\nIn this case, the longest length of a log will be $3.5$, which is the shortest possible result. After rounding up to an integer, the output should be $4$."},{"iden":"sample input 2","content":"3 0\n3 4 5"},{"iden":"sample output 2","content":"5"},{"iden":"sample input 3","content":"10 10\n158260522 877914575 602436426 24979445 861648772 623690081 433933447 476190629 262703497 211047202"},{"iden":"sample output 3","content":"292638192"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}