{"raw_statement":[{"iden":"problem statement","content":"KEYENCE has $N$ departments, where $A_i$ employees belong to the $i$\\-th department $(1 \\leq i \\leq N)$. No employee belongs to multiple departments.\nThe company is planning cross-departmental projects. Each project will be composed of exactly $K$ employees chosen from $K$ distinct departments.\nAt most how many projects can be made? No employee can participate in multiple projects."},{"iden":"constraints","content":"*   $1 \\leq K \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq A_i \\leq 10^{12}$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$\n$A_1$ $A_2$ $\\ldots$ $A_N$"},{"iden":"sample input 1","content":"3 3\n2 3 4"},{"iden":"sample output 1","content":"2\n\nThere can be two projects, each composed of three employees from distinct departments."},{"iden":"sample input 2","content":"4 2\n1 1 3 4"},{"iden":"sample output 2","content":"4"},{"iden":"sample input 3","content":"4 3\n1 1 3 4"},{"iden":"sample output 3","content":"2"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}