import heapq

class KthLargest:
    # Constructor to initialize heap and add values in it
    def __init__(self, k, nums):
        pass

    # Adds element in the heap and return the Kth largest
    def add(self, val):

        # Replace this placeholder return statement with your code

        return -1