A-masala

import heapq
N, K = map(int, input().split())
A = list(map(int, input().split()))
min_heap = A[:]
heapq.heapify(min_heap)
s = 0
remaining = K
while min_heap and remaining >= min_heap[0]:
   remaining -= heapq.heappop(min_heap)
   s += 1
q = remaining
print(s, q)

PyPy da yuboring kodi