Technocup 2017 - Elimination Round 3
E
Santa Claus and Tangerines
Codeforces
2100
原题
← DF →
翻译中…

Santa Claus has $*n*$ tangerines, and the $*i*$-th of them consists of exactly $*a*_{*i*}$ slices. Santa Claus came to a school which has $*k*$ pupils. Santa decided to treat them with tangerines.

翻译中…

However, there can be too few tangerines to present at least one tangerine to each pupil. So Santa decided to divide tangerines into parts so that no one will be offended. In order to do this, he can divide a tangerine or any existing part into two smaller equal parts. If the number of slices in the part he wants to split is odd, then one of the resulting parts will have one slice more than the other. It's forbidden to divide a part consisting of only one slice.

翻译中…

Santa Claus wants to present to everyone either a whole tangerine or exactly one part of it (that also means that everyone must get a positive number of slices). One or several tangerines or their parts may stay with Santa.

翻译中…

Let $*b*_{*i*}$ be the number of slices the $*i*$-th pupil has in the end. Let Santa's joy be the minimum among all $*b*_{*i*}$'s.

翻译中…

Your task is to find the maximum possible joy Santa can have after he treats everyone with tangerines (or their parts).

翻译中…

Input

翻译中…

The first line contains two positive integers $*n*$ and $*k*$ ($1 ≤ *n* ≤ 10^{6}$, $1 ≤ *k* ≤ 2·10^{9}$) denoting the number of tangerines and the number of pupils, respectively.

翻译中…

The second line consists of $*n*$ positive integers $*a*_{1}, *a*_{2}, ..., *a*_{*n*}$ ($1 ≤ *a*_{*i*} ≤ 10^{7}$), where $*a*_{*i*}$ stands for the number of slices the $*i*$-th tangerine consists of.

翻译中…

Output

翻译中…

If there's no way to present a tangerine or a part of tangerine to everyone, print -1. Otherwise, print the maximum possible joy that Santa can have.

翻译中…

Note

翻译中…

In the first example Santa should divide the second tangerine into two parts with $5$ and $4$ slices. After that he can present the part with $5$ slices to the first pupil and the whole first tangerine (with $5$ slices, too) to the second pupil.

翻译中…

In the second example Santa should divide both tangerines, so that he'll be able to present two parts with $6$ slices and two parts with $7$ slices.

翻译中…

In the third example Santa Claus can't present $2$ slices to $3$ pupils in such a way that everyone will have anything.

翻译中…

样例

Input #1
3 2
5 9 3
Output #1
5
InputCopy OutputCopy
Input #2
2 4
12 14
Output #2
6
InputCopy OutputCopy
Input #3
2 3
1 1
Output #3
-1
InputCopy OutputCopy
题目信息
题号
748E
时间限制
2 s
内存限制
256 MB
标签
二分
数据结构
贪心
双指针

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。