Find the Kth Largest Integer in the Array

lcpy gen -n 1985   # by problem number
lcpy gen -s kth_largest_number_in_array   # by problem name

Input: nums = ["3","6","7","10"], k = 4
Output: "3"
Explanation: The numbers in nums sorted in non-decreasing order are ["3","6","7","10"]. The 4th largest integer in nums is "3".

Input: nums = ["2","21","12","1"], k = 3
Output: "2"
Explanation: The numbers in nums sorted in non-decreasing order are ["1","2","12","21"]. The 3rd largest integer in nums is "2".

Input: nums = ["0","0"], k = 2
Output: "0"
Explanation: The numbers in nums sorted in non-decreasing order are ["0","0"]. The 2nd largest integer in nums is "0".

import heapq


class Solution:
    # Time: O(n log k)
    # Space: O(k)
    def kth_largest_number(self, nums: list[str], k: int) -> str:
        heap: list[tuple[int, str]] = []
        for num in nums:
            key = (len(num), num)
            if len(heap) < k:
                heapq.heappush(heap, key)
            elif key > heap[0]:
                heapq.heapreplace(heap, key)
        return heap[0][1]