Birthday - ReimuOJ: Reimu Online Judge

Today is your birthday and you invite

k

$k$ friends. You have

n

$n$ squared cakes and they all have the height

1

$1$ . The

i^{t h}

$i^{th}$ cake have an edge length of

A_{i}

$A_i$ . Now you want to cut these cakes in such a way that each friend has the same amount of cake, and each piece of cake must be cut from **at most** 1 cake (i.e. you can't cut a a piece of cake of size

a

$a$ from cake

A

$A$ and a piece of size

b

$b$ from cake

B

$B$ to make a piece of size

a + b

$a + b$ ). Find the maximum cake size your friends will receive. ### Input - The first line contains 2 integers

n, k

$n, k$ . - The second line contains

n

$n$ integers

A_{i}

$A_i$ . ### Output - Print the maximum size. Your answer will be considered correct if its absolute or relative error does not exceed

10^{- 3}

$10^{-3}$ . In other words, your answer,

x

$x$ , will be compared to the correct answer,

y

$y$ . If

| x - y | < 10^{- 3}

$|x-y| < 10^{-3}$ , then your answer will be considered correct. ### Constraints -

1 \leq n, A_{i} \leq 10^{5}

$1 \le n, A_i \le 10^5$ . -

1 \leq k \leq 10^{9}

$1 \le k \le 10^9$ . ### Example Input:

2545

$2 5 4 5$

Output:

8.000

$8.000$

Binary search on answer
	Reading
	Minimum maximum
	Beautiful number
	Multiplication table
	k-th digit
	Maximum mean
	Birthday
	Sorting the differences
	Collecting

Topic

Binary search

Rating

1200

Solution (0)

Solution