پستimport heapq

import heapq def get_greatest_elements(arr, k): n = len(arr) result = [] min_heap = [] for i in range(n): heapq.heappush(min_heap, arr[i]) if len(min_heap) > k: heapq.heappop(min_heap) if i >= k - 1: result.append(min_heap[0]) return result Get Greatest Elements ✅ #GamesKraft