input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
[N,M] = list(map(int,input().split()))
A = list(map(int,input().split()))
out=sum(A)
for i in range(M):
saidai = max(A)
out-=saidai
out+=saidai//2
A[A.index(saidai)] = saidai//2
# print('dam,out:',saidai,out)
print(out)
| [N,M] = list(map(int,input().split()))
A = list(map(int,input().split()))
out=sum(A)
import heapq
a = list([x*(-1) for x in A]) # 各要素を-1倍 最大値取り出すため
heapq.heapify(a)
# print(a)
for i in range(M):
# saidai = max(A)
saidai = heapq.heappop(a)*(-1)
out-=saidai
out+=saidai//2
# A[A.index(saidai)] = saidai//2
heapq.heappush(a, (saidai//2)*(-1))
# print('dam,out,a:',saidai,out,a)
print(out)
| p02912 |
import math
n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
# a.sort()
def waribiki(s,maisu):
return math.floor(s/(2**maisu))
for _ in range(m):
a.append(waribiki(max(a),1))
a.remove(max(a))
print((sum(a))) | import heapq
n,m = list(map(int, input().split()))
a = list([int(x)*(-1) for x in input().split()])
heapq.heapify(a)
for i in range(m):
target = heapq.heappop(a)
heapq.heappush(a, (-1)*(-target//2))
print((-sum(a))) | p02912 |
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
while m>0:
a[a.index(max(a))] //=2
m-=1
print((sum(a))) | import heapq
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
a = list([x*(-1) for x in a])
heapq.heapify(a)
while m>0:
ma = heapq.heappop(a)*(-1)
ma //=2
heapq.heappush(a,ma*(-1))
m-=1
print((sum(a)*(-1))) | p02912 |
N, M = list(map(int, input().split()))
A = [int(i) for i in input().split()]
for i in range(M):
ind = A.index(max(A))
A[ind] = max(A)//2
print((sum(A))) | import heapq
N, M = list(map(int, input().split()))
A = [-int(i) for i in input().split()]
heapq.heapify(A)
for i in range(M):
max_ = heapq.heappop(A)
max_ = -max_//2
heapq.heappush(A, -max_)
print((-sum(A))) | p02912 |
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
for _ in range(m):
i = A.index(max(A))
A[i] /= 2
A = [int(a) for a in A]
print((sum(A)))
| n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
A = [a * (-1) for a in A]
import heapq
heapq.heapify(A)
for _ in range(m):
a = heapq.heappop(A) * (-1)
heapq.heappush(A, a // 2 * (-1))
print((abs(sum(A))))
| p02912 |
import math
[n,m] = [int(x) for x in input().split(" ")]
an = [int(x) for x in input().split(" ")]
an.sort(reverse=True)
for i in range(m):
max_value = an[0]
an[0] = max_value / 2
an.sort(reverse=True)
discounted_an = [math.floor(x) for x in an]
print((sum(discounted_an))) | import math
[n,m] = [int(x) for x in input().split(" ")]
an = [int(x) for x in input().split(" ")]
an.sort(reverse=True)
log2_an = [math.ceil(math.log2(x) + 1) for x in an]
max_log2 = log2_an[0]
rest_ticket = m
for i in range(max_log2):
cnt = log2_an.count(log2_an[0])
if(cnt <= rest_ticket):
for j in range(cnt):
an[j] = an[j] / 2
log2_an[j] -= 1
else:
for j in range(rest_ticket):
an[j] = an[j] / 2
break
rest_ticket -= cnt
an.sort(reverse=True)
discounted_an = [math.floor(x) for x in an]
print((sum(discounted_an))) | p02912 |
N ,M = list(map(int, input().split()))
A_list = [int(i) * (-1) for i in input().split()]
import heapq
for i in range(M):
heapq.heapify(A_list)
x = heapq.heappop(A_list) / 2
heapq.heappush(A_list, (-1)*int(-x))
print((-sum(A_list)))
| N ,M = list(map(int, input().split()))
A_list = [int(i) * (-1) for i in input().split()]
import heapq
heapq.heapify(A_list)
for i in range(M):
x = heapq.heappop(A_list)
heapq.heappush(A_list, (-1)*(-x//2))
print((-sum(A_list))) | p02912 |
import bisect
from collections import deque
import math
n,m = list(map(int,input().split()))
a = sorted(deque(list(map(int, input().split()))))
for i in range(m):
p = a.pop()
p = math.floor(p/2)
index = bisect.bisect_left(a,p)
a.insert(index,p)
print((sum(a))) | import heapq
import math
n,m = list(map(int,input().split()))
a = list([int(x)*(-1) for x in input().split()])
heapq.heapify(a)
for i in range(m):
p = heapq.heappop(a)
p = math.ceil(p/2)
heapq.heappush(a,p)
print((sum(a)*(-1))) | p02912 |
import bisect
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
a = sorted(a)
for _ in range(m):
a_tmp = a.pop()
a_tmp //= 2
if(len(a)==0):a.append(a_tmp)
else:
if(a_tmp >= a[-1]):a.append(a_tmp)
elif(a_tmp <= a[0]):a.insert(0,a_tmp)
else:
index = bisect.bisect_left(a,a_tmp)
a.insert(index,a_tmp)
print((sum(a)))
| import heapq
n,m = list(map(int,input().split()))
a = list([int(x)*(-1) for x in input().split()])
heapq.heapify(a)
for _ in range(m):
x = heapq.heappop(a) * -1
x //= 2
heapq.heappush(a,-1*x)
print((-sum(a))) | p02912 |
import heapq
n,m = list(map(int,input().split()))
a = list([int(x)*(-1) for x in input().split()])
heapq.heapify(a)
for _ in range(m):
x = heapq.heappop(a) * -1
x //= 2
heapq.heappush(a,-1*x)
print((-sum(a))) | import heapq
#N,Mを取得
n,m = list(map(int,input().split()))
#A_iを取得する…と見せかけて、A_iを-1倍したものをListで取得
a = list([int(x)*(-1) for x in input().split()])
#AをListから、priority queueと言うものに変換(コレはheap queueだけど、まあ同じ)
heapq.heapify(a)
for _ in range(m): #割引券持ってるだけ使い続ける
x = heapq.heappop(a) * -1 #priority queueの先頭の値(一番値が小さい)を取り出して、-1をかけて元の値に戻す。
x //= 2 #割引する
heapq.heappush(a,-1*x) # priority queueにお返しする(-1をかけなおして)。
#割引が終わったら、合計金額を取得する。
print((-sum(a)))
| p02912 |
import sys
input = sys.stdin.readline
import heapq
n,m=list(map(int,input().split()))
a=list([int(x)*-1 for x in input().split()])
heapq.heapify(a)
for _ in range(m):
Min=heapq.heappop(a)
Min=(-Min//2)*-1
heapq.heappush(a,Min)
print((sum(a)*-1))
| import heapq
n,m=list(map(int,input().split()))
a=[]
for i in input().split():
heapq.heappush(a,-int(i))
for j in range(m):
highest = heapq.heappop(a)
heapq.heappush(a,-(-highest//2))
print((-(sum(a)))) | p02912 |
N,M=input().split()
N,M=int(N),int(M)
A=input().split()
A=[int(n) for n in A]
A.sort(reverse=True)
for i in range(M):
a=A[0]//2
del A[0]
flag=True
for j in range(N-1):
#print(A,a,A[j])
if A[j]<a:
A.insert(j,a)
#print('inserted',A)
flag=False
break
if flag:
A.insert(N-1,a)
#print('inserted',A)
sum=0
for i in range(N):
sum+=A[i]
print(sum)
| import heapq
N,M=input().split()
N,M=int(N),int(M)
A=input().split()
A=[-int(n) for n in A]
heapq.heapify(A)
for i in range(M):
a=((-1*heapq.heappop(A))//2)*(-1)
heapq.heappush(A,a)
sum=0
for i in range(N):
sum+=A[i]
print((-sum))
| p02912 |
n, m=list(map(int, input().split()))
prices=list(map(int, input().split()))
for i in range(m):
prices[prices.index(max(prices))]//=2
print((sum(prices))) | import heapq
n, m=list(map(int, input().split()))
A=list([int(x)*(-1) for x in input().split()])
heapq.heapify(A)
for _ in range(m):
temp=(-1)*heapq.heappop(A)>>1
heapq.heappush(A, temp*(-1))
print((-sum(A))) | p02912 |
import sys
import heapq
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A = list([x * (-1) for x in A])
heapq.heapify(A)
for _ in range(M):
mx = heapq.heappop(A)
heapq.heappush(A, mx // 2 if mx % 2 == 0 else mx // 2 + 1)
print((sum(A) * (-1))) | import sys
import heapq
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
#A = list(map(lambda x: x * (-1), A))
A = [-i for i in A]
heapq.heapify(A)
for _ in range(M):
mx = heapq.heappop(A)
heapq.heappush(A, mx // 2 if mx % 2 == 0 else mx // 2 + 1)
print((sum(A) * (-1))) | p02912 |
import heapq
N, M = [int(i) for i in input().split()]
a = input().split()
A = [int(i) for i in a]
#print(N, M)
#print(A)
def heapsort(list):
h = []
for i in A:
heapq.heappush(h, i)
return [heapq.heappop(h) for i in range(len(h))]
for i in range(M):
A = heapsort(A)
n = len(A) - 1
A[n] = A[n]//2
print((sum(A))) | import heapq
N, M = [int(i) for i in input().split()]
A = [-int(i) for i in input().split()]
#print(N, M)
#print(A)
heapq.heapify(A)
for i in range(M):
a = -heapq.heappop(A)
a = a//2
heapq.heappush(A, -a)
print((-sum(A))) | p02912 |
n, m = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
for _ in range(m):
a[a.index(max(a))] /= 2
for i in range(n):
a[i] = int(a[i])
print((sum(a))) | import heapq
n, m = [int(i) for i in input().split()]
a = [-int(i) for i in input().split()]
heapq.heapify(a)
for _ in range(m):
value = heapq.heappop(a)
value /= 2
heapq.heappush(a, value)
for i in range(n):
a[i] = int(-a[i])
print((sum(a))) | p02912 |
N,M = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(M):
x = max(a)
a[a.index(x)]=x//2
print((sum(a))) | import heapq
N,M = list(map(int,input().split()))
a = [-i for i in list(map(int,input().split()))]
heapq.heapify(a)
for i in range(M):
m = heapq.heappop(a)
heapq.heappush(a,-(-m//2))
print((-sum(a))) | p02912 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, M = mapint()
As = list(mapint())
Q = []
from heapq import heappop, heappush
for a in As:
heappush(Q, -a)
for i in range(M):
v = heappop(Q)
heappush(Q, v/2)
lis = [-int(x) for x in Q]
print((sum(lis))) | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, M = mapint()
As = list(mapint())
from heapq import heappush, heappop
Q = []
for a in As:
heappush(Q, -a)
for i in range(M):
a = -heappop(Q)
heappush(Q, -(a//2))
print((-sum(Q))) | p02912 |
from heapq import heappush, heappop
N, M, *A = list(map(int, open(0).read().split()))
q = []
for v in A:
heappush(q, -v)
for _ in range(M):
v = heappop(q)
heappush(q, -((-v) // 2))
print((-sum(q)))
|
from heapq import heappop, heappush
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
pq = []
for v in X:
heappush(pq, -v)
for _ in range(M):
u = heappop(pq)
heappush(pq, -(-u // 2))
print((-sum(pq)))
| p02912 |
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
def LI(): return list(map(int, sys.stdin.readline().split()))
N,M = LI()
A = LI()
A.sort()
for i in range(M):
a_max = A.pop() // 2
bisect.insort_left(A,a_max)
print((sum(A)))
| # encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import heapq
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
def LI(): return list(map(int, sys.stdin.readline().split()))
N,M = LI()
A = LI()
pq = []
for a in A:
heapq.heappush(pq,-a)
for _ in range(M):
heapq.heappush(pq,-(-heapq.heappop(pq) // 2))
# print(pq)
print((-sum(pq)))
| p02912 |
N, M = list(map(int, input().split()))
A = [int(x) for x in input().split()]
for _ in range(M):
A[A.index(max(A))] = max(A)//2
print((sum(A)))
| import heapq
N, M = list(map(int, input().split()))
A = [-int(x) for x in input().split()]
heapq.heapify(A)
for _ in range(M):
pop = heapq.heappop(A)
if pop % 2 == 0:
num = pop//2
else:
num = (pop+1)//2
heapq.heappush(A, num)
print((-sum(A)))
| p02912 |
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
from bisect import insort_left
for _ in range(m):
x = A.pop()//2
insort_left(A, x)
print((sum(A)))
| n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
A = [x * (-1) for x in A]
A = sorted(A)
from heapq import heappush, heappop
for _ in range(m):
x = heappop(A)
heappush(A, (-1*x)//2*(-1))
print((sum(A)*(-1)))
| p02912 |
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
A = [x * (-1) for x in A]
A = sorted(A)
from heapq import heappush, heappop
for _ in range(m):
x = heappop(A)
heappush(A, (-1*x)//2*(-1))
print((sum(A)*(-1)))
| n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
A = [x * (-1) for x in A]
A = sorted(A)
from heapq import heappush, heappop
for _ in range(m):
x = heappop(A)
heappush(A, -(-x//2))
print((-sum(A)))
| p02912 |
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
A = [x * (-1) for x in A]
A = sorted(A)
from heapq import heappush, heappop
for _ in range(m):
x = heappop(A)
heappush(A, -(-x//2))
print((-sum(A)))
| n, m = list(map(int, input().split()))
A = [-int(a) for a in input().split()]
A = sorted(A)
from heapq import heappush, heappop
for _ in range(m):
x = heappop(A)
heappush(A, -(-x//2))
print((-sum(A)))
| p02912 |
import heapq
N, M = list(map(int, input().split()))
A = [int(i)*(-1) for i in input().split()]
# print(A)
# for i in range(M):
# max_index = A.index(max(A))
# A[max_index] = int(A[max_index]/2)
# print(sum(A))
for i in range(M):
heapq.heapify(A)
min = heapq.heappop(A)
# 最小値を削除と値を渡す
# print(A)
# print(min)
heapq.heappush(A,int(min/2))
# print(A)
print((sum(A)*(-1))) | import heapq
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = [int(i)*(-1) for i in input().split()]
# print(A)
# for i in range(M):
# max_index = A.index(max(A))
# A[max_index] = int(A[max_index]/2)
# print(sum(A))
heapq.heapify(A)
for i in range(M):
min = heapq.heappop(A)
# 最小値を削除と値を渡す
# print(A)
# print(min)
heapq.heappush(A,int(min/2))
# print(A)
print((sum(A)*(-1)))
| p02912 |
# ABC141D - Powerful Discount Tickets
from heapq import heapify, heappop, heappush
def main():
N, M, *A = list(map(int, open(0).read().split()))
H = [-i for i in A]
heapify(H)
pop_max, push_max = lambda: -heappop(H), lambda x: heappush(H, -x)
for _ in range(M):
x = pop_max()
push_max(x // 2)
ans = -sum(H)
print(ans)
if __name__ == "__main__":
main() | # ABC141D - Powerful Discount Tickets
from heapq import heapify, heapreplace
def main():
N, M, *A = list(map(int, open(0).read().split()))
H = [-i for i in A]
heapify(H)
for _ in range(M):
x = H[0]
heapreplace(H, x // 2 + x % 2)
ans = -sum(H)
print(ans)
if __name__ == "__main__":
main() | p02912 |
# ABC141D - Powerful Discount Tickets
from heapq import heapify, heappop, heappush
def main():
_, M = list(map(int, input().split()))
A = [-i for i in map(int, input().split())]
heapify(A)
heappop_max = lambda heap: -heappop(heap)
heappush_max = lambda heap, x: heappush(heap, -x)
discount = lambda: heappush_max(A, heappop_max(A) // 2)
for _ in range(M):
discount()
print((-sum(A)))
if __name__ == "__main__":
main()
| # ABC141D - Powerful Discount Tickets
from heapq import heapify, heappop, heappush
def main():
_, M = list(map(int, input().split()))
A = [-i for i in map(int, input().split())]
heapify(A)
discount = lambda: heappush(A, -(-heappop(A) // 2))
for _ in range(M):
discount()
print((-sum(A)))
if __name__ == "__main__":
main()
| p02912 |
import heapq
N,M = list(map(int,input().split()))
Alist = list(map(int,input().split()))
newA = list([x*(-1) for x in Alist])
for i in range(M):
heapq.heapify(newA)
current = -heapq.heappop(newA)
heapq.heappush(newA,-(current//2))
cost = 0
for i in range(N):
cost += newA[i]
print((-cost)) | import heapq
N,M = list(map(int,input().split()))
Alist = list(map(int,input().split()))
newA = list([x*(-1) for x in Alist])
heapq.heapify(newA)
for i in range(M):
current = -heapq.heappop(newA)
heapq.heappush(newA,-(current//2))
cost = 0
print((-sum(newA))) | p02912 |
#!/usr/bin/env python
# coding: utf-8
# In[12]:
N,M = list(map(int, input().split()))
A = list(map(int, input().split()))
# In[13]:
for m in range(M):
idx = A.index(max(A))
A[idx] /= 2
ans = sum([x//1 for x in A])
print((int(ans)))
# In[ ]:
| #!/usr/bin/env python
# coding: utf-8
# In[18]:
import heapq
# In[23]:
N,M = list(map(int, input().split()))
A = list([int(x)*(-1) for x in input().split()])
# In[24]:
heapq.heapify(A)
for m in range(M):
tmp = heapq.heappop(A)
heapq.heappush(A, -(-tmp//2))
print((-sum(A)))
| p02912 |
import sys
from bisect import insort_right
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
for i in range(M):
tmp = A[-1-i]
insort_right(A,tmp//2)
print((sum(A[:-M]))) | import sys
import heapq
from bisect import insort_right
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A = [-a for a in A]
heapq.heapify(A)
for i in range(M):
tmp = heapq.heappop(A)
heapq.heappush(A,int(tmp/2))
print((sum([-a for a in A]))) | p02912 |
import sys
import heapq
from bisect import insort_right
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A = [-a for a in A]
heapq.heapify(A)
for i in range(M):
tmp = heapq.heappop(A)
heapq.heappush(A,int(tmp/2))
print((sum([-a for a in A]))) | from heapq import heapify,heappush,heappop
N, M = list(map(int, input().split()))
A = list([-int(x) for x in input().split()])
heapify(A)
for i in range(M):
tmp = heappop(A)
heappush(A,-((-tmp)//2))
A = list(A)
print((-sum(A)))
| p02912 |
#atcorder beginner contest 141
#D powerful discount tickets
import math
goods, tickets = input().split()
goods = int(goods)
tickets = int(tickets)
price = []
total = 0
price = list(map(int, input().split()))
for i in range(tickets):
max_index = price.index(max(price))
max_price = math.floor(max(price) / 2)
price[max_index] = max_price
for i in range(goods):
total += price[i]
print(total) | #atcorder beginner contest 141
#D powerful discount tickets
import math
import heapq
goods, tickets = list(map(int, input().split()))
price = []
price = list([int(x)*(-1) for x in input().split()])
heapq.heapify(price)
for i in range(tickets):
max = heapq.heappop(price) * (-1)
heapq.heappush(price, math.ceil(-max/2))
total = 0
for i in range(goods):
total += price[i]
print((total * (-1))) | p02912 |
n, m = list(map(int, input().split()))
item_list = list(map(int, input().split()))
for discount_i in range(m):
max_item = max(item_list)
target_index = item_list.index(max_item)
item_list[target_index] = item_list[target_index]//2
print((sum(item_list))) | import heapq
n, m = list(map(int, input().split()))
item_list = list([-1 * int(x) for x in input().split()])
heapq.heapify(item_list)
for discount_i in range(m):
target = -1*(-1*heapq.heappop(item_list)//2)
heapq.heappush(item_list, target)
print((-1*sum(item_list))) | p02912 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
while M>0:
max_A = max(A)
ind = A.index(max_A)
A[ind] = A[ind]//2
M = M-1
print((sum(A))) | import heapq
N, M = list(map(int, input().split()))
A = [-a for a in list(map(int, input().split()))]
heapq.heapify(A)
while M>0:
max_a = heapq.heappop(A)
heapq.heappush(A,-int(-max_a/2))
M = M-1
print((-sum(A))) | p02912 |
import math
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
for i in range(m):
c=math.floor(a[-1]/2)
a[-1]=c
a.sort()
sum=0
for i in range(n):
sum+=a[i]
print(sum)
| from heapq import heapify, heappop, heappush
N, M = list(map(int, input().split()))
A = [-1*int(i) for i in input().split()]
heapify(A)
for i in range(M):
n = -1 * heappop(A)
heappush(A, -1*(n//2))
print((-1*sum(A)))
| p02912 |
import math
n, m = list(map(int, input().split()))
a = [int(i) for i in input().split()]
b = [[math.log(aa, 2), i] for i, aa in enumerate(a)]
for i in range(m):
a[max(b)[1]] = int((max(a) / 2) // 1)
b[max(b)[1]][0] -= 1
print((sum(a))) | import heapq
n, m = list(map(int, input().split()))
a = [-int(i) for i in input().split()]
heapq.heapify(a)
for i in range(m):
k = heapq.heappop(a)
heapq.heappush(a, -int(-(k / 2) // 1))
print((-sum(a))) | p02912 |
import bisect
n,m=list(map(int,input().split()))
a=sorted(list(map(int,input().split())))
for i in range(m):
x=a[-(i+1)]//2
bisect.insort(a,x)
print((sum(a[:n]))) | import heapq
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
aa=list([x*(-1) for x in a])
heapq.heapify(aa)
for i in range(m):
max=heapq.heappop(aa)
heapq.heappush(aa,max//2+max%2)
print((-1*sum(aa))) | p02912 |
import heapq
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
aa=list([x*(-1) for x in a])
heapq.heapify(aa)
for i in range(m):
max=heapq.heappop(aa)
heapq.heappush(aa,max//2+max%2)
print((-1*sum(aa))) | from heapq import heappush, heappop
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
hp=[]
for i in a:
heappush(hp,-i)
for i in range(m):
max=heappop(hp)
heappush(hp, -(-max//2))
print((-sum(hp))) | p02912 |
import heapq
n,m=list(map(int,input().split()))
a=[-int(i) for i in input().split()]
heapq.heapify(a)
for i in range(m):
max=-heapq.heappop(a)
heapq.heappush(a,-1*(max//2))
print((-sum(a))) | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
from heapq import *
n,m=nii()
a=lnii()
a=[-i for i in a]
a.sort(reverse=True)
heapify(a)
for i in range(m):
x=heappop(a)
x*=-1
x//=2
heappush(a,-x)
print((-sum(a))) | p02912 |
#!/usr/bin/env python3
from bisect import insort_right
from collections import deque
n, m, *a = list(map(int, open(0).read().split()))
a = deque(sorted(a))
for _ in range(m):
insort_right(a, a.pop() >> 1)
print((sum(a)))
| #!/usr/bin/env python3
from bisect import insort_right
n, m, *a = list(map(int, open(0).read().split()))
a.sort()
for _ in range(m):
insort_right(a, a.pop() >> 1)
print((sum(a)))
| p02912 |
#!/usr/bin/env python3
from bisect import insort_right
n, m, *a = list(map(int, open(0).read().split()))
a.sort()
for _ in range(m):
insort_right(a, a.pop() >> 1)
print((sum(a)))
| #!/usr/bin/env python3
import heapq
n, m, *a = list(map(int, open(0).read().split()))
a = [*[-x for x in a]]
heapq.heapify(a)
for _ in range(m):
heapq.heappush(a, -(-heapq.heappop(a) >> 1))
print((-sum(a)))
| p02912 |
import math
import heapq
N, M = list(map(int, input().split()))
A = list([-int(a) for a in input().split()])
A.sort()
heapq.heapify(A)
for i in range(M):
a = heapq.heappop(A)
a /= 2.0
heapq.heappush(A, a)
amount = 0
for a in A:
amount += math.floor(-a)
print(amount) | import heapq
import math
mnum, gnum = list(map(int, input().split()))
array = list([-int(a) for a in input().split()])
array.sort()
heapq.heapify(array)
for i in range(gnum):
temp = heapq.heappop(array)
temp /= 2.0
heapq.heappush(array, temp)
amount = 0
for a in array:
amount += math.floor(-a)
print(amount) | p02912 |
import bisect
n, m = list(map(int, input().split()))
*a, = list(map(int, input().split()))
a = sorted(a)
for i in range(m):
a[n-1] = a[n-1] // 2
temp = a.pop()
bisect.insort_left(a, temp)
print((sum(a))) | import heapq
n, m = list(map(int, input().split()))
*a, = list(map(int, input().split()))
ans = []
for i in range(n):
heapq.heappush(ans, -a[i])
for i in range(m):
temp = -heapq.heappop(ans)
heapq.heappush(ans, -(temp//2))
print((-sum(ans))) | p02912 |
import bisect
n,m = list(map(int,input().split()))
A = list(map(int,input().split()))
A.sort()
for _ in range(m):
a = A.pop() // 2
A.insert(bisect.bisect_left(A,a),a)
print((sum(A))) | import bisect
import heapq
n,m = list(map(int,input().split()))
A = list(map(int,input().split()))
A = list([x*(-1) for x in A])
heapq.heapify(A)
for _ in range(m):
a = -heapq.heappop(A)//2
heapq.heappush(A,-a)
print((-sum(A))) | p02912 |
# -*- coding: utf-8 -*-
# abc141/abc141_d
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
def main():
N, M = i2nn()
A = i2nn()
A2 = sorted(A, reverse=True)
for _ in range(M):
discount(A2, N)
print((sum(A2)))
return
def discount(A, N):
A[0] = A[0] >> 1
for i in range(N - 1):
if A[i] < A[i+1]:
A[i], A[i+1] = A[i+1], A[i]
else:
break
# print(A)
main()
| # -*- coding: utf-8 -*-
# abc141/abc141_d
import sys
import heapq
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
def main():
N, M = i2nn()
h = [-int(s) for s in sys.stdin.readline().rstrip().split()]
heapq.heapify(h)
for _ in range(M):
top_h = -(-h[0] // 2)
heapq.heapreplace(h, top_h)
print((-sum(h)))
main()
| p02912 |
# -*- coding: utf-8 -*-
# abc141/abc141_d
import sys
import heapq
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
def main():
N, M = i2nn()
h = [-int(s) for s in sys.stdin.readline().rstrip().split()]
heapq.heapify(h)
for _ in range(M):
top_h = -(-h[0] // 2)
heapq.heapreplace(h, top_h)
print((-sum(h)))
main()
| # -*- coding: utf-8 -*-
# abc141/abc141_d
import sys
import heapq
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
def main():
N, M = i2nn()
h = [-int(s) for s in sys.stdin.readline().rstrip().split()]
heapq.heapify(h)
for _ in range(M):
heapq.heapreplace(h, -(-h[0] // 2))
print((-sum(h)))
main()
| p02912 |
import bisect
from collections import deque
import sys
def input():
return sys.stdin.readline().strip()
def main():
N,M = list(map(int,input().split()))
A = sorted(list(map(int,input().split())))
que = deque(A)
for _ in range(M):
max_value = que.pop()
bisect.insort_right(que,max_value // 2)
print((sum(que)))
if __name__ == "__main__":
main() | import heapq
import sys
def input():
return sys.stdin.readline().strip()
def main():
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
A = list([x*(-1) for x in A])
heapq.heapify(A)
for _ in range(M):
max_value = heapq.heappop(A) * (-1)
heapq.heappush(A,max_value//2 * (-1))
print((sum(A) * (-1)))
if __name__ == "__main__":
main() | p02912 |
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(m):
a.sort()
a[a.index(max(a))]//=2
print((sum(a))) | from heapq import *
n,m = list(map(int,input().split()))
a = list([-int(x) for x in input().split()])
heapify(a)
for i in range(m):
heappush(a,-(-heappop(a)//2))
print((-sum(a))) | p02912 |
n, m = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
if n == 1:
while m > 0:
a[0] //= 2
m -= 1
print((a[0]))
exit()
while m > 0:
a[0] //= 2
m -= 1
if a[0] < a[1]:
a.sort(reverse = True)
print((sum(a)))
| n, m = list(map(int, input().split()))
a = sorted(list(map(int, input().split())), reverse=True)
if n == 1:
while m > 0:
a[0] //= 2
m -= 1
print((a[0]))
exit()
while m > 0:
a.sort(reverse = True)
mid = a[0] // 2
i = 0
while a[i] >= mid:
if m > 0:
a[i] //= 2
m -= 1
i += 1
else:
break
if i == len(a):
break
print((sum(a)))
| p02912 |
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
ans=0
while M!=0:
val=max(A)
index=A.index(val)
A[index]//=2
M-=1
print((sum(A))) | import heapq
N,M=list(map(int,input().split()))
lst=list(map(int,input().split()))
A=[]
for i in range(N):
heapq.heappush(A,-1*lst[i])
while M!=0:
val=heapq.heappop(A)
M-=1
new_val=val/2
heapq.heappush(A,new_val)
ans=0
for i in range(N):
ans+=-1*int(A[i])
print(ans) | p02912 |
import heapq
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
q=[]
for i in range(n):
q.append((-1)*a[i])
for k in range(m):
heapq.heapify(q)
ma=heapq.heappop(q)
if ma%2==0:
heapq.heappush(q,ma//2)
else:
heapq.heappush(q,ma//2+1)
print((sum(q)*(-1))) | import heapq
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
q=[]
for i in range(n):
q.append((-1)*a[i])
heapq.heapify(q)
for k in range(m):
ma=heapq.heappop(q)
if ma%2==0:
heapq.heappush(q,ma//2)
else:
heapq.heappush(q,ma//2+1)
print((sum(q)*(-1))) | p02912 |
N,M = [int(i) for i in input().split()]
data = [int(i) for i in input().split()]
data.sort(reverse = True)
#print(data)
while M != 0:
x = max(data)
data[data.index(x)] //= 2
M -= 1
#print(data)
print((sum(data))) | import heapq
N,M = [int(i) for i in input().split()]
data = [int(i) for i in input().split()]
data = list([x*(-1) for x in data])
heapq.heapify(data)
#print(data)
while M != 0:
x = heapq.heappop(data)*(-1)
heapq.heappush(data,-1*(x//2))
M -= 1
#print(data)
print((-sum(data))) | p02912 |
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(m):
a.sort(reverse=True)
a[0]=int((a[0]/2)//1)
print((sum(a)))
| import heapq as hq
n,m=list(map(int,input().split()))
a=[-int(x) for x in input().split()]
hq.heapify(a)
for i in range(m):
x=hq.heappop(a)
x=-x//2
hq.heappush(a,-x)
print((sum(a)*-1))
| p02912 |
import heapq
import math
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list([x * (-1) for x in a])
heapq.heapify(b)
for i in range(m):
h = heapq.heappop(b)
heapq.heappush(b, math.ceil(h / 2))
c = list([x * (-1) for x in b])
print((sum(c)))
| import heapq
import math
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list([x * (-1) for x in a])
heapq.heapify(b)
for i in range(m):
h = heapq.heappop(b)
heapq.heappush(b, math.ceil(h / 2))
print((sum(b)*(-1))) | p02912 |
import heapq
n,m = list(map(int, input().split()))
a = list(map(int, input().split()))
def heapsort(iterable):
h = []
for value in iterable:
heapq.heappush(h, value)
return [heapq.heappop(h) for i in range(len(h))]
for i in range(m):
m -= 0
a = heapsort(a)
a[-1] = a[-1] // 2
print((sum(a)))
"""
for i in range(m):
a.sort()
a.reverse()
m -= 1
a[0] = a[0] // 2
print(sum(a))
"""
| import heapq
n,m = list(map(int, input().split()))
#a = list(map(int, input().split()))
a = [-int(n) for n in input().split()]
heapq.heapify(a)
for i in range(m):
tmp = heapq.heappop(a)
tmp = int(tmp/2)
heapq.heappush(a,tmp)
print((-sum(a)))
"""
for i in range(m):
a.sort()
a.reverse()
m -= 1
a[0] = a[0] // 2
print(sum(a))
"""
"""
def heapsort(iterable):
h = []
for value in iterable:
heapq.heappush(h, value)
return [heapq.heappop(h) for i in range(len(h))]
"""
| p02912 |
N,M = list(map(int,input().split()))
A=[int(n) for n in input().split()]
A.sort()
def insert_sort(arr):
for i in range(1, len(arr)):
j = i - 1
ele = arr[i]
while arr[j] > ele and j >= 0:
arr[j + 1] = arr[j]
j -= 1
arr[j + 1] = ele
return arr
for _ in range(M):
A[-1] = A[-1]//2
A = insert_sort(A)
print((sum(A))) | import heapq
N,M = list(map(int,input().split()))
H=[]
for i in input().split():
heapq.heappush(H,-int(i))
for i in range(M):
a = heapq.heappop(H)
heapq.heappush(H,-(-a//2))
print((-sum(H))) | p02912 |
import heapq
from fractions import Fraction
n, m = list(map(int, input().split()))
a = list([Fraction(1, int(x)) for x in input().split()])
heapq.heapify(a)
for i in range(m):
x = heapq.heappop(a)
heapq.heappush(a, Fraction(x.numerator * 2, x.denominator))
s = 0
for j in range(n):
s += int(Fraction(a[j].denominator, a[j].numerator))
print(s)
| import heapq
from fractions import Fraction
n, m = list(map(int, input().split()))
a = list([Fraction(1, int(x)) for x in input().split()])
heapq.heapify(a)
for i in range(m):
x = heapq.heappop(a)
y = Fraction(x.numerator * 2, x.denominator)
if y.numerator < y.denominator:
heapq.heappush(a, y)
elif len(a) == 0:
break
s = 0
for j in range(len(a)):
s += int(Fraction(a[j].denominator, a[j].numerator))
print(s)
| p02912 |
import heapq
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
heap = []
for i in a:
heapq.heappush(heap, -i)
for i in range(m):
x = - heapq.heappop(heap)
x = x / 2
heapq.heappush(heap, - x)
print((sum([int (-n) for n in heap])))
| import heapq
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
heap = []
for i in a:
heapq.heappush(heap, -i)
for i in range(m):
x = - heapq.heappop(heap)
x = x // 2
heapq.heappush(heap, - x)
print((sum([int (-n) for n in heap])))
| p02912 |
n, m = list(map(int, input().split()))
li_a = list(map(int, input().split()))
li_w = li_a
for i in range(m):
li_w = sorted(li_w, reverse=True)
li_w[0] = li_w[0] // 2
print((sum(li_w)))
| import heapq
import math
n, m = list(map(int, input().split()))
li_a = list([x * -1 for x in (list(map(int, input().split())))])
heapq.heapify(li_a)
for i in range(m):
w = heapq.heappop(li_a)
heapq.heappush(li_a, math.ceil(w / 2))
print((sum(li_a) * -1))
| p02912 |
def main():
import heapq
n, m, *a = [-int(x) for x in open(0).read().split()]
heapq.heapify(a)
while m:
x = heapq.heappop(a)
heapq.heappush(a, x / 2)
m += 1
ans = -sum([int(x) for x in a])
print(ans)
if __name__ == '__main__':
main()
| def main():
import heapq
n, m, *a = [-int(x) for x in open(0).read().split()]
heapq.heapify(a)
for _ in range(-m):
x = heapq.heappop(a)
heapq.heappush(a, x / 2)
ans = -sum([int(x) for x in a])
print(ans)
if __name__ == '__main__':
main()
| p02912 |
N, M = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(M):
max_item = A.index(max(A))
A[max_item] //= 2
print((sum(A))) | import heapq
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
#全要素に-1かける
for i in range(len(A)):
A[i] *= -1
heapq.heapify(A)
for _ in range(M):
x = heapq.heappop(A)
heapq.heappush(A, (-x//2)*(-1))
print((-sum(A))) | p02912 |
n,m=list(map(int, input().split()))
a=list(map(int, input().split()))
for _ in range(m):
a[a.index(max(a))] //=2
print((sum(a))) | n,m=list(map(int, input().split()))
a=list(map(int, input().split()))
from heapq import heappush, heappop
hq=[]
for a_val in a:
# heappopで最も小さい値が取り出されるため、(-1)をかけて入れる
heappush(hq, -a_val)
for _ in range(m):
heappush(hq, -(heappop(hq)//(-2)))
print((-sum(hq))) | p02912 |
import heapq
n, m = list(map(int, input().split()))
A = list([int(x)*-1 for x in input().split()])
for i in range(m):
heapq.heapify(A)
max_elm = heapq.heappop(A)*-1 //2
heapq.heappush(A, max_elm*-1)
print((sum(A)*-1)) | import heapq
n, m = list(map(int, input().split()))
A = list([int(x)*-1 for x in input().split()])
heapq.heapify(A)
for i in range(m):
max_elm = heapq.heappop(A)*-1 //2
heapq.heappush(A, max_elm*-1)
print((sum(A)*-1)) | p02912 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(M):
maxA = max(A)
A.remove(maxA)
maxA = maxA // 2
A.append(maxA)
print((sum(A))) | import heapq
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
h = []
for i in range(N):
A[i] *= -1
for i in range(N):
heapq.heappush(h, A[i])
for i in range(M):
num = heapq.heappop(h)
num = num * -1
num = num // 2
heapq.heappush(h, -num)
print((-sum(h)))
| p02912 |
f = lambda:list(map(int,input().split()))
_,m = f()
l = list([-x for x in f()])
import heapq as hq
hq.heapify(l)
for i in range(m):
p = -hq.heappop(l)//2
hq.heappush(l,-p)
print((-sum(l))) | f=lambda:input().split()
_,m=list(map(int,f()))
l=[-int(i) for i in f()]
from heapq import *
heapify(l)
for _ in range(m):
heappush(l,-(-heappop(l)//2))
print((-sum(l))) | p02912 |
f = lambda:list(map(int,input().split()))
n,m = f()
l = sorted(f())
for _ in range(m):
l.append(l.pop()//2)
l.sort()
print((sum(l))) | f = lambda:input().split()
n,m = list(map(int,f()))
l = [-int(i) for i in f()]
from heapq import *
heapify(l)
for i in range(m):
heappush(l,-(-heappop(l)//2))
print((-sum(l))) | p02912 |
import bisect
import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
while M > 0:
tmp = A.pop()
tmp = tmp // 2
bisect.insort_right(A, tmp)
M -= 1
print((sum(A)))
if __name__ == '__main__':
main() | import heapq
import sys
input = sys.stdin.readline
def main():
N, M = list(map(int, input().split()))
A = list([int(x) * (-1) for x in input().split()])
heapq.heapify(A)
for _ in range(M):
tmp = heapq.heappop(A)
tmp *= -1
tmp = tmp // 2
heapq.heappush(A, tmp * (-1))
print((sum(A) * (-1)))
if __name__ == '__main__':
main()
| p02912 |
#ソートしてでかいやつから割引券使っていって、次に値段が高いやつよりも値段が低くなれば次にいく。
#これを繰り返せばいい。
#一周してもまだ割引券が余っていればもう一度ソートして同じことをする。
#途中で割引券がなくなれば終了して、合計を計算する。
#実際に買い物をする順番は気にしなくていい。どこで何枚使うのが最適かが分かればいい
#ということは割引券を使うたび毎回ソートする？
n,m = list(map(int,input().split()))
A = list(map(int,input().split()))
#print(A)
A.sort(reverse=True)
while m!=0:
M_A = max(A)
A[0] = M_A //2
m -= 1
A.sort(reverse=True)
print((sum(A)))
| #ソートしてでかいやつから割引券使っていって、次に値段が高いやつよりも値段が低くなれば次にいく。
#これを繰り返せばいい。
#一周してもまだ割引券が余っていればもう一度ソートして同じことをする。
#途中で割引券がなくなれば終了して、合計を計算する。
#実際に買い物をする順番は気にしなくていい。どこで何枚使うのが最適かが分かればいい
#ということは割引券を使うたび毎回ソートする？
#毎回ソートしてるとやっぱりTLEになる。次に値段が高いやつよりも値段が低くなれば次にいく。でいい
#n,m = map(int,input().split())
#A = list(map(int,input().split()))
#print(A)
#A.sort(reverse=True)
#while m!=0:
# while A[0] > A[1]:
# M_A = max(A)
# A[0] = M_A //2
# m -= 1
#A.sort(reverse=True)
#print(sum(A))
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(n):
a[i]=a[i]*(-1)
import heapq
#小さい順に並べる
heapq.heapify(a)
for j in range(m):
# 最小値を取り出して-1をかけ,bとする。
b=heapq.heappop(a)*(-1)
# b//2に-1をかけて,aに入れる。
heapq.heappush(a,(b//2)*(-1))
#print(a)
c=sum(a)
print((c*(-1)))
| p02912 |
from heapq import heappop, heappush
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
H = []
for a in A:
heappush(H, -a)
cnt = 0
while cnt < M:
a = heappop(H)
heappush(H, -((-a)//2))
cnt += 1
print((-sum(H))) | from heapq import heappop, heappush
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
H = []
for a in A:
heappush(H, -a)
for _ in range(M):
a = heappop(H)
heappush(H, -((-a)//2))
print((-sum(H))) | p02912 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.buffer.readline
class SkewHeap:
def __init__(self, init_val = None, left = None, right = None):
self.val = init_val
self.left = left
self.right = right
self.root = None
def heapmeld(self, h1, h2):
if h1 == None: return h2
if h2 == None: return h1
if h1.val > h2.val:
h1.val, h1.left, h1.right, h2.val, h2.left, h2.right = h2.val, h2.left, h2.right, h1.val, h1.left, h1.right
h1.right = self.heapmeld(h2, h1.right)
return h1
def heappop(self):
if self.root == None:
res = self.val
h = self.heapmeld(self.left, self.right)
if h == None: h = SkewHeap(None)
self.val, self.left, self.right = h.val, h.left, h.right
return res
res = self.root.val
self.root = self.heapmeld(self.root.left, self.root.right)
return res
def heappush(self, x):
h = SkewHeap(x)
self.root = self.heapmeld(self.root, h)
N, M = list(map(int, input().split()))
a = list(map(int, input().split()))
h = SkewHeap()
res = 0
for e in a:
h.heappush(-e)
for _ in range(M):
h.heappush(-(-h.heappop() // 2))
for _ in range(N):
res -= h.heappop()
print(res) | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.buffer.readline
class SkewHeap:
def __init__(self, init_val = None):
self.val = init_val
self.left = None
self.right = None
self.root = None
def heapmeld(self, h1, h2):
if h1 == None: return h2
if h2 == None: return h1
if h1.val > h2.val:
h1.val, h1.left, h1.right, h2.val, h2.left, h2.right = h2.val, h2.left, h2.right, h1.val, h1.left, h1.right
h1.right = self.heapmeld(h2, h1.right)
h1.left, h1.right = h1.right, h1.left
return h1
def heappop(self):
res = self.root.val
self.root = self.heapmeld(self.root.left, self.root.right)
return res
def heappush(self, x):
h = SkewHeap(x)
self.root = self.heapmeld(self.root, h)
def heaptop(self):
return self.root.val
N, M = list(map(int, input().split()))
a = list(map(int, input().split()))
h = SkewHeap()
res = 0
for e in a:
h.heappush(-e)
for _ in range(M):
h.heappush(-(-h.heappop() // 2))
for _ in range(N):
res -= h.heappop()
print(res)
| p02912 |
n, m = list(map(int, input().split()))
a = list([int(x) for x in input().split()])
for i in range(m):
a[a.index(max(a))] = max(a)//2
print((sum(a))) | import heapq
n, m = list(map(int, input().split()))
a = [-int(x) for x in input().split()]
heapq.heapify(a)
for i in range(m):
l = -heapq.heappop(a)
heapq.heappush(a, -(l//2))
print((-sum(a))) | p02912 |
import heapq
n, m = list(map(int, input().split()))
a = [-int(x) for x in input().split()]
heapq.heapify(a)
for i in range(m):
l = -heapq.heappop(a)
heapq.heappush(a, -(l//2))
print((-sum(a))) | import heapq
def main():
N, M = list(map(int, input().split()))
A = list(int(x)*-1 for x in input().split())
heapq.heapify(A)
for _ in range(M):
a = (heapq.heappop(A)*-1)//2
heapq.heappush(A,a*-1)
print((sum(A)*-1))
if __name__ == '__main__':
main() | p02912 |
N,M = list(map(int,input().split()))
a = list(map(int,input().split()))
res = sum(a)
dis = 0
for v in range(M):
a.sort(reverse=True)
dis += a[0] - a[0]//2
a[0] //=2
print((res-dis))
| import heapq
N,M = list(map(int,input().split()))
a = list(map(int,input().split()))
a = list([x*(-1) for x in a])
heapq.heapify(a)
for _ in range(M):
heapq.heappush(a,((heapq.heappop(a)*(-1))//2)*(-1))
print((abs(sum(a))))
| p02912 |
from queue import PriorityQueue
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
queue = PriorityQueue(N)
for a in A:
queue.put(-a)
for i in range(M):
a = -queue.get()
a /= 2
queue.put(-a)
ans = 0
for i in range(N):
ans += int(-queue.get())
print(ans)
| from heapq import heapify, heappush, heappop
N, M = list(map(int, input().split()))
A = list([-int(x) for x in input().split()])
heapify(A)
for i in range(M):
heappush(A, -(-heappop(A) // 2))
print((-sum(A)))
| p02912 |
N, M = list(map(int, input().split()))
AS = list(map(int, input().split()))
for i in range(M):
hi = max(list(range(N)), key = lambda n : AS[n])
AS[hi]//=2
print((sum(AS)))
| N, M = list(map(int, input().split()))
AS = list(map(int, input().split()))
import math
buckets = [[] for i in range(31)]
count = [0 for i in range(31)]
for num in AS:
buckets[math.floor(math.log(num)/math.log(2))].append(num)
for lst in buckets: lst.sort(reverse=True)
hi = 30
while buckets[hi-1] == []: hi -= 1
found = 0
while True:
try:
if M > found:
for i in range(hi, 31):
count[i] += 1
hi -= 1
M -= found
found += len(buckets[hi])
else:
total = 0
for i in range(hi):
total += sum(buckets[i])
lst = []
for i in range(hi, 30):
for item in buckets[i]:
lst.append(item // pow(2, count[i]))
lst.sort(reverse=True)
for i in range(M):
lst[i] //= 2
total += sum(lst)
print(total)
break
except:
print((0))
break
| p02912 |
import bisect
n , m = list(map(int, input().split()))
a = list(map(int,input().split()))
a.sort()
for i in range(m):
t = a[n-1]//2
index = bisect.bisect_left(a,t)
a.insert(index,t)
a=a[:n]
print((sum(a)))
| import heapq
n , m = list(map(int, input().split()))
a = list(map(int,input().split()))
for i in range(n):
a[i]*=-1
heapq.heapify(a)
for i in range(m):
t = (heapq.heappop(a)*(-1)//2)*(-1)
heapq.heappush(a,t)
print((sum(a)*(-1)))
| p02912 |
n,m=list(map(int,input().split()))
A=list(map(int,input().split()))
for k in range(m):
A[A.index(max(A))]//=2
print((sum(A)))
| import heapq
n,m=list(map(int,input().split()))
A=list([int(x)*-1 for x in input().split()])
heapq.heapify(A)
for k in range(m):
a=heapq.heappop(A)
heapq.heappush(A, -1*(-a//2))
print(((sum(A))*-1)) | p02912 |
#import heapq
n, m = list(map(int, input().split()))
lst = list(map(int, input().split()))
for i in range(m):
lst[lst.index(max(lst))] //= 2
print((sum(lst))) | import heapq
n, m = list(map(int, input().split()))
lst = list([-1*int(x) for x in input().split()])
heapq.heapify(lst)
for i in range(m):
heapq.heappush(lst, -(-heapq.heappop(lst)//2))
print((-1*sum(lst))) | p02912 |
L1 = input().split(" ")
L2 = input().split(" ")
tickets = int(L1[1])
L2int = [int(s) for s in L2]
for t in range(tickets):
M = max(L2int)
L2int[L2int.index(M)] = M//2
print((sum(L2int))) | import heapq
L1 = input().split(" ")
L2 = input().split(" ")
tickets = int(L1[1])
L2int = [-int(s) for s in L2]
heapq.heapify(L2int)
for t in range(tickets):
heapq.heappush(L2int,-(-heapq.heappop(L2int)//2))
print((-sum(L2int))) | p02912 |
N, M = list(map(int, input().split()))
li = list(map(int, input().split()))
for i in range(M):
MAX = max(li)
li[li.index(MAX)] = MAX // 2
print((sum(li)))
| import heapq
N, M = list(map(int, input().split()))
li = list([int(x) * (-1) for x in input().split()])
heapq.heapify(li)
for i in range(M):
max_price = heapq.heappop(li)*(-1)
heapq.heappush(li, (-1) * (max_price // 2))
print((-sum(li))) | p02912 |
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
a.sort(reverse=True)
def move(a):
for i in range(len(a)-1):
if a[i] < a[i+1]:
a[i],a[i+1] = a[i+1],a[i]
else:
break
return a
for i in range(m):
a[0] //= 2
a = move(a)
ans = 0
for x in a:
ans += x
print(ans)
| import heapq
n,m = list(map(int,input().split()))
a = list([int(x)*(-1) for x in input().split()])
a.sort(reverse=True)
heapq.heapify(a)
for i in range(m):
x = -heapq.heappop(a)
x //= 2
heapq.heappush(a,-x)
print((-sum(a)))
| p02912 |
N, M = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
for _ in range(M):
i = A.index(max(A))
A[i] = A[i] // 2
print((sum(A))) | import heapq
N, M = list(map(int, input().split(" ")))
A = list([-int(x) for x in input().split(" ")])
heapq.heapify(A)
for _ in range(M):
a = -heapq.heappop(A)
a = a // 2
heapq.heappush(A, -a)
print((-sum(A))) | p02912 |
N, M = list(map(int, input().split()))
A = [int(i) for i in input().split()]
A.sort()
for i in range(M):
A[N-1] = A[N-1] // 2
if A[N-1] < A[N-2]:
A.sort()
print((sum(A))) | import heapq
N, M = list(map(int, input().split()))
A = [int(i) * (-1) for i in input().split()]
heapq.heapify(A)
h = heapq.heappop(A)
for i in range(M):
h = heapq.heappushpop(A, (h*(-1))//2*(-1))
print(((sum(A)+h) * (-1))) | p02912 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(M):
A = sorted(A, reverse=True)
A[0] = int(A[0] / 2)
from functools import reduce
print((reduce(lambda x, y:x + y, A)))
| from heapq import heapify, heappop, heappush
N, M = list(map(int, input().split()))
A = list([-1 * int(x) for x in input().split()])
heapify(A)
for i in range(M):
heappush(A, int(heappop(A) / 2))
print((-1 * sum(A)))
| p02912 |
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
for _ in range(m):
a[a.index(max(a))] = a[a.index(max(a))] // 2
print((sum(a)))
| import heapq
n, m = list(map(int, input().split()))
a = []
for i in list(map(int, input().split())):
heapq.heappush(a, -i)
for _ in range(m):
p = heapq.heappop(a)
heapq.heappush(a, int(p/2))
print((-sum(a)))
| p02912 |
def resolve():
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(m):
ma = max(a)
a[a.index(ma)] //= 2
print((sum(a)))
if __name__ == "__main__":
resolve()
| import heapq
def resolve():
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
query = []
for i in range(n):
heapq.heappush(query, -a[i])
for i in range(m):
nexta = -1 * heapq.heappop(query) // 2
heapq.heappush(query, -nexta)
print((-sum(query)))
if __name__ == "__main__":
resolve()
| p02912 |
n,m=list(map(int,input().split()))
pricelist=list(map(int,input().split()))
for i in range(m):
pricelist.sort(reverse=True)
pricelist[0]//=2
print((sum(pricelist))) | #ABC-141-D
def main():
n,m=list(map(int,input().split(" ")))
s=list(map(int,input().split(" ")))
s.sort(reverse=True)
while m!=0:
tmp=s[0]//2
s[0]=tmp
m-=1
for j in range(1,n):
if m==0:
break
else:
if s[j]>=tmp:
s[j]=s[j]//2
m-=1
else:
break
s.sort(reverse=True)
if s[0]==0:
break
print((sum(s)))
main() | p02912 |
import bisect
n, m = list(map(int, input().split()))
price = sorted(list(map(int, input().split())))
while m >= 1:
new_price = price[-1] // 2
bisect.insort_left(price, new_price)
del price[-1]
m -= 1
print((sum(price))) | import heapq
n, m = list(map(int, input().split()))
price = list([-x for x in list(map(int, input().split()))])
heapq.heapify(price)
while m >= 1:
a = (heapq.heappop(price) + 1) // 2
heapq.heappush(price, a)
m -= 1
print((sum(price) * (-1))) | p02912 |
import bisect
n,m = [int(i) for i in input().split()]
l = sorted([int(i) for i in input().split()])
[bisect.insort(l,l[n-1]//2) for _ in range(m)]
print((sum(l[0:n]))) | import heapq
n,m = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
h = []
for i in l:
i = -1*i
heapq.heappush(h,i)
for _ in range(m):
v = -heapq.heappop(h)
heapq.heappush(h,-1*(v//2))
print((-sum(h))) | p02912 |
N,M = list(map(int, input().split()))
A = []
for X in input().split():
A.append(int(X))
for x in range(M):
max_num = A.index(max(A))
A[max_num] = A[max_num] / 2
sum = 0
for x in range(len(A)):
sum += int(A[x])
print(sum)
| import heapq
N,M = list(map(int, input().split()))
A = [-int(n) for n in input().split()]
heapq.heapify(A)
for x in range(M):
heapq.heappush(A, heapq.heappop(A)/2)
A_int = list(map(int, A))
print((-sum(A_int)))
| p02912 |
import heapq
def main():
N, M = [int(x) for x in input().split()]
heap = [-int(x) for x in input().split()]
heapq.heapify(heap)
for _ in range(M):
x = heapq.heappop(heap)
x = -x
x = x // 2
x = -x
heapq.heappush(heap, x)
print((sum([-x for x in heap])))
if __name__ == '__main__':
main() | import heapq
def main():
N, M = [int(x) for x in input().split()]
heap = [-int(x) for x in input().split()]
heapq.heapify(heap)
for _ in range(M):
x = heapq.heappop(heap)
x = -x
x = x // 2
x = -x
heapq.heappush(heap, x)
print((-sum(heap)))
if __name__ == '__main__':
main() | p02912 |
import bisect
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
a = sorted(a)
for i in range(m):
a[-1] = int(a[-1] / 2)
tmp = a[:-1]
p = bisect.bisect_left(tmp, a[-1])
a = tmp[:p] + [a[-1]] + tmp[p:]
print((sum(a))) | import heapq
n, m = list(map(int, input().split()))
a = list([int(x)*(-1) for x in input().split()])
heapq.heapify(a)
for i in range(m):
tmp = int(heapq.heappop(a) / 2)
heapq.heappush(a, tmp)
print((-1 * sum(a))) | p02912 |
N,M = list(map(int,input().split()))
list_A = list(map(int,input().split()))
for i in range(M):
A = max(list_A)
list_A.remove(A)
list_A.append(A // 2)
print((sum(list_A))) | N,M=list(map(int,input().split()))
import sys
A= list(map(int,sys.stdin.readline().split()))
A=[i*-1 for i in A]
import heapq
heapq.heapify(A)
for i in range(M):
X=heapq.heappop(A)
X=abs(X)//2*-1
heapq.heappush(A,X)
print((abs(sum(A)))) | p02912 |
N,M = list(map(int, input().split()))
money = list(map(int, input().split()))
for i in range(M):
money[money.index(max(money))]//=2
print((sum(money))) | import heapq
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
b=[-int(i) for i in a]
heapq.heapify(b)
for i in range(m):
x=-heapq.heappop(b)//2
heapq.heappush(b,-x)
print((-sum(b)))
| p02912 |
n,m = list(map(int, input().split()))
lst = list(map(int, input().split()))
# lst.sort(reverse=True)
for i in range(m):
lst.sort(reverse=True)
lst[0]=int(lst[0]/2)
# if lst[0]<lst[1]:
# lst[0],lst[1]=lst[1],lst[0]
print((sum(lst)))
| import heapq
n,m = list(map(int, input().split()))
lst = [-int(i) for i in input().split()]
heapq.heapify(lst)
for i in range(m):
a=-(-heapq.heappop(lst)//2)
heapq.heappush(lst, a)
print((-sum(lst)))
| p02912 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
"""
A.sort(reverse=True)
for m in range(M):
A[m] //= 2
A.sort()
#print(A)
print(sum(A))
"""
for i in range(M):
m = A.index(max(A))
A[m] //= 2
#print(A)
print((sum(A))) | import heapq
N, M = list(map(int, input().split()))
A = list([int(x)*(-1) for x in input().split()])
heapq.heapify(A)
#print(A)
for _ in range(M):
m = heapq.heappop(A)
#print(m)
heapq.heappush(A, -(-m // 2))
#print(A)
print((-sum(A)))
| p02912 |
n = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n[1]):
a[a.index(max(a))]=int(max(a)/2)
print((sum(a))) | import heapq
N, M= list(map(int, input().split()))
A = list(map(int, input().split()))
a=[-1*i for i in A]
heapq.heapify(a)
for i in range(M):
m=int(heapq.heappop(a)/2)
heapq.heappush(a, m)
print((-1*sum(a))) | p02912 |
N, M = list(map(int, input().split()))
A = [int(i) for i in input().split()]
A_sorted = sorted(A, reverse=True)
for i in range(M):
s = A_sorted[:i+1]
A_sorted[A_sorted.index(max(s))] /= 2
ans = 0
for i in range(N):
ans += A_sorted[i]//1
print((int(ans))) | import heapq
N, M = list(map(int, input().split()))
A = [-int(i) for i in input().split()]
heapq.heapify(A)
for i in range(M):
tmp_min = heapq.heappop(A)
heapq.heappush(A, (-tmp_min//2)*(-1))
print((-sum(A))) | p02912 |
def main():
N, M = list(map(int, input().split()))
A_i = list(map(int, input().split()))
for i in range(M):
m = max(A_i)
A_i.remove(m)
m = m//2
A_i.append(m)
print((sum(A_i)))
main()
| import heapq
def main():
N, M = list(map(int, input().split()))
A_i = list([-int(x) for x in input().split()])
heapq.heapify(A_i)
for i in range(M):
m = -heapq.heappop(A_i)
m = m//2
heapq.heappush(A_i, -m)
print((-sum(A_i)))
main()
| p02912 |
from collections import deque
import bisect
import math
N, M = list(map(int, input().split()))
A = sorted([-int(_) for _ in input().split()])
deq = deque(A)
for m in range(M):
div = deq.popleft()
div = math.ceil(div / 2)
tmp_lis = list(deq)
#print(tmp_lis)
bisect.insort(tmp_lis, div)
deq = deque(tmp_lis)
print((-sum(deq))) | import heapq
N, M = list(map(int, input().split()))
A = [-int(_) for _ in input().split()]
heapq.heapify(A)
tmp = 0
for m in range(M):
div = -heapq.heappop(A)
div = div // 2
heapq.heappush(A, -div)
print((-sum(A))) | p02912 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.