A817.Acowdemia I--Bronze

普及-

USACO

通过率:0%

时间限制:1.00s

内存限制:128MB

题目描述

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 a survey article citing
several of her past papers. Due to page limits, she can include at most LL
citations in this survey (0L1050 \leq L \leq 10^5), and of course she can cite
each of her papers at most once.
Help Bessie determine the maximum hh-index she may achieve after writing this
survey.
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 of input contains NN and LL.
The second line contains NN space-separated integers c1,,cNc_1,\ldots, c_N.

输出格式

The maximum hh-index Bessie may achieve after writing the survey.

输入输出样例

  • 输入#1

    4 0
    1 100 2 3
    

    输出#1

    2
    

说明/提示

Bessie cannot cite any of her past papers. As mentioned above, the hh-index
for (1,100,2,3)(1,100,2,3) is 22.

首页