Fractile | Topcoder Archive

Problem Statement

Given a int[] x and a percentile p (between 0 and 100, inclusive), find the smallest element y in x such that at least p percent of the elements in x are less than or equal to y.

Definition

Class:: Fractile
Method:: fractile
Parameters:: int[], int
Returns:: int
Method signature:: int fractile(int[] x, int p)
(be sure your method is public)

Constraints

x will contain between 1 and 50 elements, inclusive.
Each element of x will be between -1000000 and 1000000, inclusive.
p will be between 0 and 100, inclusive.

Examples

```
{-3,-5,2,1}
```
```
50
```
```
Returns: -3
```
50 percent of the elements in x are less than or equal to -3: -5 and -3.
```
{7,9,2,-10,-6}
```
```
50
```
```
Returns: 2
```
60 percent of the elements in x are less than or equal to 2, and 40 percent are less than or equal to -6. At least 50% of the elements must be less than or equal to the answer, so the answer is 2.
```
{1,2,3,4,5,6,7,8,9,10}
```
```
39
```
```
Returns: 4
```
4 gives 40%, but 3 gives 30%, which is not enough, so 4 is the answer.

{1,2,3,4,5,6,7,8,9,1,2,3,4,5,7,9,5,43,124,94}

Returns: 1

The smallest element of x is 1 and it gives 5%.

```
{1}
```
```
100
```
```
Returns: 1
```
1 is the only element of x, so there is no choice at all.

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.