leetcode

0 class Solution {

1 public:

2 vector<int> kthSmallestPrimeFraction(const vector<int> &arr, int k) const {

3 priority_queue<tuple<double, int, int>> pq;

4

5 for (int i = 0; i < arr.size(); i++) {

6 pq.emplace(-1.0 * arr[i] / arr.back(), i, arr.size() - 1);

7 }

8

9 while (true) {

10 auto [_, i, j] = pq.top();

11 pq.pop();

12 if (!--k) return {arr[i], arr[j]};

13 if (--j > i) pq.emplace(-1.0 * arr[i] / arr[j], i, j);

14 }

15

16 return {};

17 }

18 };