P1577 Cutting Ropes

There are $N$ ropes with lengths $L_i$. If we cut from them $K$ ropes of equal length, determine the maximum possible length of each of these $K$ ropes. Keep the answer to two decimal places (truncate after the second decimal digit).

The first line contains two integers $N$ and $K$. Each of the next $N$ lines describes the length $L_i$ of a rope.

Output the maximum length of each rope after cutting. The answer will be accepted if the absolute error does not exceed $0.01$ or the relative error does not exceed $1\%$.

Constraints: For $100\%$ of the testdata, $0 < L_i \leq 100000.00$, $0 < N \leq 10000$, $0 < K \leq 10000$. Translated by ChatGPT 5