TopCoder problem "CarrotBoxesEasy" used in SRM 495 (Division II Level One)



Problem Statement

    Rabbit Hanako has N boxes of carrots numbered 0 through N-1. The i-th box contains carrots[i] carrots.



She decides to eat K carrots from these boxes. She will eat the carrots one at a time, each time choosing a carrot from the box with the greatest number of carrots. If there are multiple such boxes, she will choose the lowest numbered box among them.



Return the number of the box from which she will eat her last carrot.
 

Definition

    
Class:CarrotBoxesEasy
Method:theIndex
Parameters:int[], int
Returns:int
Method signature:int theIndex(int[] carrots, int K)
(be sure your method is public)
    
 

Constraints

-carrots will contain between 1 and 50 elements, inclusive.
-Each element of carrots will be between 1 and 100, inclusive.
-K will be between 1 and the sum of all elements of carrots, inclusive.
 

Examples

0)
    
{5, 8}
3
Returns: 1
She will choose three carrots from box 1.
1)
    
{5, 8}
4
Returns: 0
After she chooses three carrots from box 1, both boxes contain 5 carrots. She will choose the 4th carrot from the lowest indexed box.
2)
    
{4, 9, 5}
18
Returns: 2
3)
    
{13, 75, 24, 55}
140
Returns: 0
4)
    
{14, 36, 52, 86, 27, 97, 3, 67}
300
Returns: 4

Problem url:

http://www.topcoder.com/stat?c=problem_statement&pm=11307

Problem stats url:

http://www.topcoder.com/tc?module=ProblemDetail&rd=14424&pm=11307

Writer:

rng_58

Testers:

PabloGilberto , ivan_metelsky , soul-net

Problem categories:

Simulation