CarrotBoxesEasy | Topcoder Archive

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

```
{5, 8}
```
```
3
```
```
Returns: 1
```
She will choose three carrots from box 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.
```
{4, 9, 5}
```
```
18
```
```
Returns: 2
```
```
{13, 75, 24, 55}
```
```
140
```
```
Returns: 0
```

{14, 36, 52, 86, 27, 97, 3, 67}

Returns: 4

This problem statement is the exclusive and proprietary property of Topcoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of Topcoder, Inc. is strictly prohibited. (c)2024, Topcoder, Inc. All rights reserved.