A sorted array of integers, **A** contains **1**, plus some number of primes. Then, for every p < q in the list, we consider the fraction p/q.

What is the **B-th** smallest fraction considered?

Return your answer as an array of integers, where **answer[0] = p** and **answer[1] = q**.

**Input Format:**

```
The first argument of input contains the integer array, A.
The second argument of input contains an integer B.
```

**Output Format:**

```
Return an array of two integers, where answer[0] = p and answer[1] = q.
```

**Constraints:**

```
1 <= length(A) <= 2000
1 <= A[i] <= 30000
1 <= K <= length(A)*(length(A) - 1)/2
```

**Examples:**

```
Input 1:
A = [1, 2, 3, 5]
B = 3
Output 1:
[2, 5]
Explanation 1:
The fractions to be considered in sorted order are:
[1/5, 1/3, 2/5, 1/2, 3/5, 2/3]
The third fraction is 2/5.
Input 2:
A = [1, 7]
B = 1
Output 2:
[1, 7]
Explanation 2:
The fractions to be considered in sorted order are:
[1/7]
The first fraction is 1/7.
```

NOTE:You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.

Sign Up

to access hints and editorial solutions for**B-th Smallest Prime Fraction**

to access hints and editorial solutions for

Loading...