Ciel and Eggs
All submissions for this problem are available.
Chef Ciel has N strange eggs.
The i-th egg is broken by tapping exactly Ai times.
Ciel needs to break K eggs as soon as possible for cooking a rice omelet.
However she has been put in an uncomfortable situation. Someone shuffled the eggs!
Ciel knows the values Ai, however she doesn't know which egg is which.
She'd like to minimize the worst-case number of taps.
What is the minimal number?
The first line contains an integer T, the number of test cases.
Then T test cases follow.
The first line for each test case has 2 integers N and K.
Then next line has N integers A1, A2, ..., AN.
For each test case, print the minimal number of taps for the worst-case.
1 ≤ T ≤ 10
1 ≤ K ≤ N ≤ 500
1 ≤ Ai ≤ 1000000 (106)
3 2 1 5 8 2 1 5 58 3 2 1 2 3
8 10 5
In the first case, if a egg isn't broken after 5 taps, she should continue to tap the same egg.
In the second case, if a egg isn't broken after 5 taps, she should tap another egg 5 times.
|Tags||dec11, laycurse, medium|
|Time Limit:||1.04894 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.