import heapq
class Solution:
    def findKthLargest(self, nums: list, k: int) -> int:
        inner_list = nums[k]
        inner_list = sorted(inner_list)[::-1]
        if k == lem(nums)


heapq.nlargest(2, [2,3,4,5,8,3])
