I want to get the K largest elements from an array of size n using a max heap (I need to use a heap). I need a runtime of O(n + klogk). I'm thinking of modifying my max heap's heapify function so that it only goes to the level in the tree where our kth largest element is. For example, say we want the 50 largest elements. The level where that 50th largest element is will be at log₂ (50). Can we modify the heapify so that this will work? I don't know how I'd get that in code. Any help would he great. Thanks!