Solving K th Smallest Prime Fraction in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Examples:
Input: A = [1, 2, 3, 5], K = 3
Output: [2, 5]
Explanation:
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: A = [1, 7], K = 1
Output: [1, 7]

Note:

See the full details of the problem K th Smallest Prime Fraction at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go