comefrom: <garvit244>215_1.py
code: def findKthLargest( nums, k):
      heap = []
      import heapq
      for num in nums:
          heapq.heappush(heap, -(num))
      
      result = 0
      for _ in range(k):
          result = heapq.heappop(heap)
      
      return -(result)
masked: def sample_funcname ( var_0 , var_1 ) :
      var_2 = [ ]
      import var_3
      for var_4 in var_0 :
          var_3.heappush ( var_2 , - ( var_4 ) )
      var_7 = 0
      for var_9 in range ( var_1 ) :
          var_7 = var_3.heappop ( var_2 )
      return - ( var_7 )
  