<gh_stars>0
import heapq
"""
solution from Joma on AlgoPro
"""
def findKthLargest(array, k):
	array = [-val for val in array]
	heapq.heapify(array)
	for i in range(0, k - 2):
		heapq.heappop(array)
		
	return -heapq.heappop(array)

import heapq
"""
solution from Joma on AlgoPro
"""
def findKthLargest(array, k):
	array = [-val for val in array]
	heapq.heapify(array)
	for i in range(0, k - 2):
		heapq.heappop(array)
		
	return -heapq.heappop(array)
solution from Joma on AlgoPro