import heapq

n,m=map(int,input().split())
a=list(map(lambda x:int(x)*(-1),input().split()))
heapq.heapify(a)

for i in range(m):
  top=heapq.heappop(a)
  heapq.heappush(a,(-1)*(-top//2))
  
print(-sum(a)) import heapq heapq n,m=map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split m a=list(map(lambda x:int(x)*(-1),input().split())) a list(map(lambda x:int(x)*(-1),input().split())) list map(lambda x:int(x)*(-1),input().split()) map lambda x:int(x)*(-1) int(x)*(-1) int(x) int x -1 x input().split() ().split () input split heapq.heapify(a) heapq.heapify heapq heapify a for i in range(m):
  top=heapq.heappop(a)
  heapq.heappush(a,(-1)*(-top//2))
   i range(m) range m top=heapq.heappop(a) top heapq.heappop(a) heapq.heappop heapq heappop a heapq.heappush(a,(-1)*(-top//2)) heapq.heappush heapq heappush a (-1)*(-top//2) -1 -top//2 -top top 2 print(-sum(a)) print -sum(a) sum(a) sum a m=map(int,input().split()) map(int,input().split()) m top=heapq.heappop(a) heapq.heappop(a) top n,m=map(int,input().split()) map(int,input().split()) n a=list(map(lambda x:int(x)*(-1),input().split())) list(map(lambda x:int(x)*(-1),input().split())) a
import heapq

n,m=map(int,input().split())
a=list(map(lambda x:int(x)*(-1),input().split()))
heapq.heapify(a)

for i in range(m):
  top=heapq.heappop(a)
  heapq.heappush(a,(-1)*(-top//2))
  
print(-sum(a))