PivotOJ

Acowdemia

시간 제한: 1000ms메모리 제한: 512MB출처: USACO 2021 Open SilverBOJ 21819

문제

Bessie the cow has enrolled in a computer science PhD program, driven by her love of computer science and also the allure of one day becoming "Dr. Bessie". Having worked for some time on her academic research, she has now published NN papers (1N1051 \leq N \leq 10^5), and her ii-th paper has accumulated cic_i citations (0ci1050 \leq c_i \leq 10^5) from other papers in the research literature.

Bessie has heard that an academic's success can be measured by their hh-index. The hh-index is the largest number hh such that the researcher has at least hh papers each with at least hh citations. For example, a researcher with 44 papers and respective citation counts (1,100,2,3)(1,100,2,3) has an hh-index of 22, whereas if the citation counts were (1,100,3,3)(1,100,3,3) then the hh-index would be 33.

To up her hh-index, Bessie is planning to write up to KK survey articles (0K1050 \leq K \leq 10^5), each citing many of her past papers. However, due to page limits, she can only cite at most LL papers in each survey (0L1050 \leq L \leq 10^5). Of course, no paper may be cited multiple times in a single survey (but a paper may be cited in several surveys).

Help Bessie determine the maximum hh-index she may achieve after writing these survey articles. Bessie is not allowed to cite a survey from one of her surveys.

Note that Bessie's research advisor should probably inform her at some point that writing a survey solely to increase one's hh index is ethically dubious; other academics are not recommended to follow Bessie's example here.

입력

The first line contains NN, KK, and LL.

The second line contains NN space-separated integers c1,,cNc_1,\ldots, c_N.

출력

The maximum hh-index on a single line.

예제

예제 1

입력
4 4 1
1 100 1 1
출력
3

예제 2

입력
4 1 4
1 100 1 1
출력
2
코드를 제출하려면 로그인하세요.