786. K-th Smallest Prime Fraction

[흑화뉴비(coderhs)]

class Solution:

    def kthSmallestPrimeFraction(self, arr: List[int], k: int) -> List[int]:

        n = len(arr)

        frac = []

        for i in range(n-1):

            for j in range(i+1, n):

                frac.append([arr[i]/arr[j], arr[i], arr[j]])

        frac.sort()

        return frac[k-1][1:]

그냥 정렬 문제인데 왜 내는걸까..