[LeetCode 378. Kth Smallest Element in a Sorted Matrix ] Stack Easy (19주차 9/10, 23/150)

이렇게 풀면 엄청 느릴 것 같지만...

class Solution:
    def kthSmallest(self, matrix: List[List[int]], k: int) -> int:
        data = []
        for i in range(len(matrix[0])):
            for j in range(len(matrix)):
                data.append(matrix[i][j])
            
        data.sort()
        
        return data[k-1]