CodeChef is a non-commercial competitive programming community
Login
Username (New User? Signup) Password (Forgot Password?)
Signup
Login or
Signup with
Connect
Note
  • Publicize your achievements on your Facebook Wall.
  • Challenge your friends or ask them for help.

Site Navigation

  • PRACTICE
    • Easy
    • Medium
    • Hard
    • Challenge
    • Peer
  • COMPETE
    • All Contests
    • June Long 2012
    • May Cook-Off
    • May Long 2012
  • DISCUSS
    • Forums
    • Blog
    • Wiki
    • Facebook
    • Twitter
  • COMMUNITY
    • CodeChef Meetups
    • Campus Chapters
    • Host your Contest
    • User Groups
    • CodeChef TechTalks
    • All Educational Initiatives
  • HELP
    • Frequently Asked Questions
    • FAQ for problem setters
    • Problem Setting
    • Tutorials
    • Long Contest Ranks
    • Short Contest Ranks
    • Event Calendar
  • ABOUT
    • About CodeChef
    • Team CodeChef
    • Press Room
    • CodeChef Financials
    • CodeChef Sponsorships
    • CEO's Corner
    • Contact Us
    • About Directi
Home » Compete » December 2011 Long Contest » Ciel and Eggs

Ciel and Eggs

Problem code: STREGGS

  • All Submissions

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?

Input

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.

Output

For each test case, print the minimal number of taps for the worst-case.

Constraints

1 <= T <= 10
1 <= K <= N <= 500
1 <= Ai <= 1000000 (106)

Sample Input

3
2 1
5 8
2 1
5 58
3 2
1 2 3

Sample Output

8
10
5

Output details

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.


Author: laycurse
Date Added: 23-08-2011
Time Limit: 8 sec
Source Limit: 50000 Bytes
Languages: ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, CS2, D, ERL, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TCL, TEXT, WSPC


  • Submit

Comments

  • Login or Register to post a comment.

can anyone provide more test

keshav_pes @ 1 Dec 2011 07:47 PM
can anyone provide more test cases....plz

Can anyone explain the 3rd

markfroilan @ 1 Dec 2011 09:04 PM
Can anyone explain the 3rd test case?

In third case, you just tap

niquefa_diego @ 1 Dec 2011 10:14 PM
In third case, you just tap two eggs until they break. In the worst case you break eggs 2 and 3, tapping 5 times.

I dont think so it's that way

flareneos @ 2 Dec 2011 03:08 AM
I dont think so it's that way in 3rd test.. I think it's tap each of them once, you will break one, then tap each of them once more and you will break egg 2. Correct me if I'm wrong

I had not think about that

niquefa_diego @ 2 Dec 2011 08:39 AM
I had not think about that way of solving third case, and I think is correct. But my strategy seems to be right too...

@flareneos u're right.

kq_viet @ 2 Dec 2011 08:56 AM
@flareneos u're right.

Array A[] is always in the

k1ps @ 2 Dec 2011 02:03 PM
Array A[] is always in the increasing order?

is the Ai array always in

nnpai53 @ 2 Dec 2011 08:01 PM
is the Ai array always in increasing order?

@nnpai53 and k1ps: I don't

mng88 @ 2 Dec 2011 10:09 PM
@nnpai53 and k1ps: I don't think so, as no such ordering has been mentioned in the problem statement.

Can Ciel remember about

mkagenius @ 3 Dec 2011 07:51 PM
Can Ciel remember about previous eggs which has already been tapped once?

@mkagenius Yes

hiroto_adm @ 4 Dec 2011 10:16 AM
@mkagenius Yes

can anyone provide some more

assasin143 @ 5 Dec 2011 01:49 PM
can anyone provide some more test cases??? pls....

@assasin143: your test case

cyberax @ 5 Dec 2011 11:33 PM
@assasin143: your test case is simply not a valid input.

@assasin143: please do not

david_adm @ 6 Dec 2011 04:18 AM
@assasin143: please do not post additional test cases during the contest.

Hello Admin, Is there a

devbabu @ 6 Dec 2011 08:22 PM
Hello Admin, Is there a provision to know for the number of input cases and against how many inputs was the solution correct?

@admin: If I get wrong answer

karthikabinav @ 6 Dec 2011 09:05 PM
@admin: If I get wrong answer at 11 secs in one submission and 14.5 secs in another changed submission with the order of algorithm remaining the same, does it mean in the second case it has passed more test cases ?!

Hi i am getting the correct

chandu_333 @ 7 Dec 2011 01:31 PM
Hi i am getting the correct output in my computer the same m getting it here wrong...Does the new line character matters?...for the no of taps for the egg i have read in separate lines...plz help me

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

Programming Competition Fetching successful submissions
Directi Go for Gold
CodeChef is a global programming communityCodeChef hosts online programming competitions
CodeChef is a non-commercial competitive programming community
  • About CodeChef
  • About Directi
  • CEO's Corner
  • C-Programming
  • Programming Languages
  • Contact Us
© 2009 Directi Group. All Rights Reserved. CodeChef uses SPOJ © by Sphere Research Labs
In order to report copyright violations of any kind, send in an email to copyright@codechef.com
CodeChef a product of Directi
The time now is:
CodeChef - A Platform for Aspiring Programmers

CodeChef was created as a platform to help programmers make it big in the world of algorithms, computer programming and programming contests. At CodeChef we work hard to revive the geek in you by hosting a programming contest at the start of the month and another smaller programming challenge in the middle of the month. We also aim to have training sessions and discussions related to algorithms, binary search, technicalities like array size and the likes. Apart from providing a platform for programming competitions, CodeChef also has various algorithm tutorials and forum discussions to help those who are new to the world of computer programming.

Practice Section - A Place to hone your 'Computer Programming Skills'

Try your hand at one of our many practice problems and submit your solution in a language of your choice. Our programming contest judge accepts solutions in over 35+ programming languages. Preparing for coding contests were never this much fun! Receive points, and move up through the CodeChef ranks. Use our practice section to better prepare yourself for the multiple programming challenges that take place through-out the month on CodeChef.

Compete - Monthly Programming Contests and Cook-offs

Here is where you can show off your computer programming skills. Take part in our 10 day long monthly coding contest and the shorter format Cook-off coding contest. Put yourself up for recognition and win great prizes. Our programming contests have prizes worth up to Rs.20,000 and $700lots more CodeChef goodies up for grabs.

Discuss

Are you new to computer programming? Do you need help with algorithms? Then be a part of CodeChef's Forums and interact with all our programmers - they love helping out other programmers and sharing their ideas. Have discussions around binary search, array size, branch-and-bound, Dijkstra's algorithm, Encryption algorithm and more by visiting the CodeChef Forums and Wiki section.

CodeChef Community

As part of our Educational initiative, we give institutes the opportunity to associate with CodeChef in the form of Campus Chapters. Hosting online programming competitions is not the only feature on CodeChef. You can also host a coding contest for your institute on CodeChef, organize an algorithm event and be a guest author on our blog.

Go For Gold

The Go for Gold Initiative was launched about a year after CodeChef was incepted, to help prepare Indian students for the ACM ICPC World Finals competition. In the run up to the ACM ICPC competition, the Go for Gold initiative uses CodeChef as a platform to train students for the ACM ICPC competition via multiple warm up contests. As an added incentive the Go for Gold initiative is also offering over Rs.8 lacs to the Indian team that beats the 29th position at the ACM ICPC world finals. Find out more about the Go for Gold and the ACM ICPC competition here.

Domain Name Registration, Web hosting, and Website Design provided by BigRock.com