input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import math
import collections
import itertools
import sys
import bisect
from heapq import heappop,heappush
sys.setrecursionlimit(10**6)
def MAP(): return list(map(int,input().split()))
def INT(): return int(eval(input()))
def FLOAT(): return float(eval(input()))
MOD = 10**9+7
n,m = MAP()
a = MAP()
for i in range(m):
idx = a.index(max(a))
a[idx] = a[idx]//2
print((sum(a))) | import math
import collections
import itertools
import sys
import bisect
from heapq import heappop,heappush,heapify
sys.setrecursionlimit(10**6)
def MAP(): return list(map(int,input().split()))
def INT(): return int(eval(input()))
def FLOAT(): return float(eval(input()))
MOD = 10**9+7
n,m = MAP()
a = MAP()
a = [-i for i in a]
heapify(a)
for i in range(m):
tmp = -heappop(a)
heappush(a,-(tmp//2))
print((-sum(a))) | p02912 |
N, M = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
for _ in range(M):
A[0] = int(A[0]/2)
A = sorted(A, reverse=True)
print((sum(A))) | from heapq import (
heapify, # 優先度付きキューの生成
heappop,
heappush,
heappushpop,
heapreplace
)
N, M = list(map(int, input().split()))
#heapqは最小値しか取り出さないので-1倍する
A = [-i for i in map(int,input().split())]
heapify(A)
for _ in range(M):
s = -heappop(A)
s //= 2
heappush(A, -s)
print((-sum(A))) | p02912 |
#!/usr/bin/env python3
N, M = list(map(int, input().split()))
a_list = list(map(int, input().split()))
for _ in range(M):
a_list = sorted(a_list, reverse=True)
a_list[0] = a_list[0] // 2
ans = sum(a_list)
print(ans)
| #!/usr/bin/env python3
import heapq
N, M = list(map(int, input().split()))
a_list = list(map(int, input().split()))
# Pythonのheapqは最小値しかとれないので、負の値に変換して扱う
a_list = list([x * (-1) for x in a_list])
heapq.heapify(a_list)
for _ in range(M):
max_value = -heapq.heappop(a_list)
heapq.heappush(a_list, -(max_value // 2))
ans = -sum(a_list)
print(ans)
| p02912 |
from bisect import bisect_right
n,m = list(map(int,input().split()))
aa = list(map(int,input().split()))
aa = sorted(aa)
for i in range(m):
tmp = aa[-1]//2
aa.pop()
pos = bisect_right(aa,tmp)
aa.insert(pos,tmp)
print((sum(aa))) | # dequeにinsert追加されたのは 3.5 から
from heapq import heappop,heappush,heapify
n,m = list(map(int,input().split()))
aa = list(map(int,input().split()))
aa = list([-x for x in aa])
heapify(aa)
for i in range(m):
tmp = heappop(aa)
heappush(aa,-(-tmp//2))
print((-sum(aa))) | p02912 |
n, m = list(map(int,input().split()))
A = list(map(int,input().split()))
A = [x * -1 for x in A]
A.sort()
import heapq
import bisect
heapq.heapify(A)
for _ in range(m):
min_ = heapq.heappop(A)
tmp = min_ * -1 // 2 * -1
index = bisect.bisect_left(A, tmp)
heapq.heappush(A,tmp)
print((sum(A) * -1))
| n, m = list(map(int,input().split()))
A = [x * -1 for x in list(map(int,input().split()))]
import heapq
heapq.heapify(A)
for _ in range(m):
min_ = heapq.heappop(A)
tmp = min_ * -1 // 2 * -1
heapq.heappush(A,tmp)
print((sum(A) * -1))
| p02912 |
#!/usr/bin/env python3
from heapq import heapify, heappop, heappush
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
a = [-1*item for item in a]
heapify(a)
for i in range(m):
max = -1* heappop(a)
heappush(a, int(-1*max/2)) # 要素の挿入
a = [-1*item for item in a]
ans = sum(list(a))
print(ans)
| #!/usr/bin/env python3
from heapq import heapify, heappop, heappush
n, m = list(map(int, input().split()))
a = list([int(x)*-1 for x in input().split()])
heapify(a)
for i in range(m):
min = heappop(a)
heappush(a, (-1)*(-1*min//2)) # 要素の挿入
ans = -sum(a)
print(ans)
| p02912 |
n,m=list(map(int,input().split()))
A=list(map(int,input().split()))
for i in range(m):
a=max(A)
y=A.index(max(A))
A[y]=a//2
print((sum(A))) | from heapq import heappop, heappush
n,m=list(map(int,input().split()))
A=list(map(int,input().split()))
B=sorted([x * -1 for x in A])
for i in range(m):
a=heappop(B)
a=-(-a//2)
heappush(B,a)
print((-sum(B))) | p02912 |
from heapq import heappop, heappush
n,m=list(map(int,input().split()))
A=list(map(int,input().split()))
B=sorted([x * -1 for x in A])
for i in range(m):
a=heappop(B)
a=-(-a//2)
heappush(B,a)
print((-sum(B))) | from heapq import heappop,heappush,heapify
n,m=list(map(int,input().split()))
A=[-i for i in list(map(int,input().split()))]
heapify(A)
for i in range(m):
a=heappop(A)
heappush(A,-(-a//2))
print((-sum(A))) | p02912 |
import heapq
n ,m = list(map(int,input().split()))
arr =list(map(int,input().split()))
for _ in range(m):
j =int( heapq.nlargest(1,arr)[0])//2
arr.remove(max(arr))
arr.append(j)
print((sum(arr))) | from heapq import heappop, heappush, heapify
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
q = []
for x in a:
heappush(q, -x)
for _ in range(m):
l = heappop(q)
heappush(q, -((-l)//2))
print((-sum(q)))
| p02912 |
N, M = list(map(int, input().split()))
price = list(map(int, input().split()))
for i in range(M):
price[price.index(max(price))] //= 2
print((sum(price))) | from heapq import heappop, heappush
N, M = list(map(int, input().split()))
price = list(map(int, input().split()))
he = []
for i in price:
heappush(he, -i)
for i in range(M):
max = heappop(he)
heappush(he, -(-max//2))
print((-sum(he))) | 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):
tmp = (heapq.heappop(a) * (-1)) // 2
heapq.heappush(a, -tmp)
print((sum(a) * -1))
| from heapq import heapify, heappop, heappush
N, M = list(map(int, input().split()))
A = []
for i in input().split():
A.append(-int(i))
heapify(A)
for _ in range(M):
a = -heappop(A)
heappush(A, (a // 2) * -1)
# print('A', A)
ans = -sum(A)
print(ans)
| p02912 |
import heapq
n,m=list(map(int,input().split()))
item=list(map(int,input().split()))
for i in range(n):item[i]=item[i]*-1
for i in range(m):
heapq.heapify(item)
a=heapq.heappop(item)
heapq.heappush(item,((-1*a)//2)*-1)
print((sum(item)*-1)) | import heapq
n,m=list(map(int,input().split()))
item=list([-int(x) for x in input().split()])
heapq.heapify(item)
for i in range(m):
a=-heapq.heappop(item)
a //=2
heapq.heappush(item,-a)
print((-sum(item))) | p02912 |
import math
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
a = sorted(a)
for i in range(m):
p = a.pop()
p = math.floor(p/2)
a.append(p)
a = sorted(a)
print((sum(a))) | from heapq import heappop,heappush,heapify
import math
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
a = list([-x for x in a])
heapify(a)
for i in range(m):
p = heappop(a)
heappush(a,math.ceil(p/2))
ans = 0
for _ in range(n):
p = heappop(a)
ans += -p
print(ans) | p02912 |
from bisect import bisect_left
n,m = [int(x) for x in input().split()]
a = sorted([int(x) for x in input().split()])
for i in range(m):
a.insert(bisect_left(a,a[n-1] // 2),a[n-1] // 2)
a.pop(n)
print((sum(a)))
| import heapq
n,m = [int(x) for x in input().split()]
a = list([int(x)*(-1) for x in input().split()])
heapq.heapify(a)
for _ in range(m):
max = heapq.heappop(a)
heapq.heappush(a,(-1)*(-max//2))
print((-sum(a)))
| p02912 |
N, M = list(map(int, input().split())) # 品物の数、割引券の枚数
A = list(map(int, input().split())) # 品物の値段
for _ in range(M):
tmp = A.index(max(A))
A[tmp] = A[tmp] // 2
print((str(sum(A))))
| N, M = list(map(int, input().split())) # 品物の数、割引券の枚数
A = list(map(int, input().split())) # 品物の値段
A.sort(reverse=True)
i = 0
for _ in range(M):
A[i] = A[i] // 2
if i <= N - 2 and A[i] < A[i + 1] and A[0] < A[i+1]:
i += 1
else:
A.sort(reverse=True)
i = 0
print((str(sum(A)))) | p02912 |
import math
s=list(map(int,input().split()))
t=list(map(int,input().split()))
a=0
t.sort(reverse=True)
if s[0]>=2:
for i in range(s[1]):
t[0]=math.floor(t[0]/2)
if t[0]<t[1]:
t.sort(reverse=True)
else:
for j in range(s[1]):
t[0]=math.floor(t[0]/2)
a=sum(t)
print(a) | import math
s=list(map(int,input().split()))
t=list(map(int,input().split()))
a=0
b=0
c=0
d=s[1]
t.sort(reverse=True)
if s[0]==1:
for i in range(s[1]):
t[0]=math.floor(t[0]/2)
else:
c=t[0]/2
for j in range(s[1]):
for l in range(s[0]):
if d>0:
if c<t[l]:
t[l]=math.floor(t[l]/2)
d=d-1
else:
t.sort(reverse=True)
c=t[0]/2
break
else:
break
e=sum(t)
print(e) | p02912 |
if __name__ == '__main__':
n,m = list(map(int, input().split()))
a_list = list(map(int, input().split()))
a_list = sorted(a_list, reverse=True)
search_range = 1
while m > 0:
max_index = a_list[0:search_range].index(max(a_list[0:search_range]))
a_list[max_index] = a_list[max_index] // 2
m -= 1
search_range += 1
answer = sum(a_list)
print(answer)
| import heapq
if __name__ == '__main__':
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
q = []
for x in a:
heapq.heappush(q, -x)
for i in range(m):
x = heapq.heappop(q)
x /= 2
heapq.heappush(q,x)
answer = 0
for x in q:
answer += int(-x//1)
print(answer)
| p02912 |
import math
N,M=[int(s) for s in input().split()]
ls=[int(s) for s in input().split()]
ls.sort(reverse=True)
x=ls[0]
L=int(math.log2(x))
#2**L より大きいものをわける
def cut(lst,exp):
for ii in range(len(lst)):
if ii+1==len(lst):
break
if lst[ii+1]<exp:
break
return ii
m=M #残り回数
b=-1
ls3=[]
while True:
if m==0:
break
a=b+1
b=cut(ls,2**L)
ls2=ls[a:b+1]
ls3=ls3+ls2
ls3.sort(reverse=True)
for j in range(len(ls3)):
ls3[j]=ls3[j]//2
m-=1
if m==0:
break
L-=1
# print(ls3,m,b)
#print(ls3,ls[b+1:])
s=sum(ls3)+sum(ls[b+1:])
print(s)
| import math
N,M=[int(s) for s in input().split()]
ls=[int(s) for s in input().split()]
ls.sort(reverse=True)
x=ls[0]
L=int(math.log2(x))
#2**L より大きいものをわける
def cut(lst,exp):
for ii in range(len(lst)):
if ii+1==len(lst):
break
if lst[ii+1]<exp:
break
return ii
m=M #残り回数
b=-1
ls3=[]
while True:
if m==0:
break
a=b+1
b=cut(ls,2**L)
ls2=ls[a:b+1]
ls3=ls3+ls2
if ls2!=[]:
ls3.sort(reverse=True)
for j in range(len(ls3)):
ls3[j]=ls3[j]//2
m-=1
if m==0:
break
L-=1
# print(ls3,m,b)
#print(ls3,ls[b+1:])
s=sum(ls3)+sum(ls[b+1:])
print(s)
| p02912 |
import heapq
N,M=[int(s) for s in input().split()]
ls=[int(s) for s in input().split()]
h = []
for e in ls:
heapq.heappush(h, (-e,e))
for i in range(M):
x=heapq.heappop(h)
y=x[1]//2
heapq.heappush(h,(-y,y))
ls2=[e[1] for e in h]
print((sum(ls2)))
| import heapq
N,M=[int(s) for s in input().split()]
ls=input().split()
h = []
for e in ls:
heapq.heappush(h, -int(e))
for i in range(M):
x=heapq.heappop(h)
y=(-x)//2
heapq.heappush(h,-y)
print((-sum(h)))
| p02912 |
N, M = list(map(int, input().split()))
mylist = list(map(int, input().split()))
mycnt = 1
while mycnt <= M:
mylist[mylist.index(max(mylist))] = max(mylist)//2
#print(mylist[mylist.index(max(mylist))])
mycnt += 1
mysum = sum(mylist)
print(mysum) | import heapq
N,M = list(map(int,input().split()))
A = [int(i)*-1 for i in input().split()]
heapq.heapify(A)
#print(A)
for _ in range(M):
max = heapq.heappop(A) * -1
#print(max, A)
heapq.heappush(A,(max//2)*-1)
#print(A)
print((sum(A)*-1)) | p02912 |
N,M = list(map( int,input().split() ))
A = list( map(int,input().split()) )
remain = M
while remain > 0:
i = A.index(max(A))
A[i] = A[i]//2
remain -= 1
print((sum(A)))
| import heapq
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
A=[-i for i in A]
heapq.heapify(A)
for i in range(M):
a=-heapq.heappop(A)
heapq.heappush(A,-(a//2))
print((-sum(A))) | p02912 |
n,m = list(map(int,input().split()))
s = list(map(int, input().split()))
#print(type(s))
for _ in range(m):
max_value = max(s)
max_index = s.index(max_value)
s[max_index] = s[max_index] // 2
print((sum(s))) | import heapq
n,m = list(map(int,input().split()))
s = list([int(x) * -1 for x in input().split()])
#print(type(s))
heapq.heapify(s)
for _ in range(m):
heapq.heappush(s,int(heapq.heappop(s)/2))
sum = sum(s)*-1
print(sum)
| p02912 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
for _ in range(M):
m = max(A)
A[A.index(m)] = m // 2
print((sum(A))) | import heapq
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A = list([-x for x in A])
heapq.heapify(A)
for _ in range(M):
a = -heapq.heappop(A)
heapq.heappush(A, -(a//2))
print((-sum(A))) | p02912 |
import bisect
N,M = list(map(int, input().split()))
A = sorted(map(int, input().split()))
for i in range(M):
bisect.insort(A, A.pop()//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 i in range(M):
a = heapq.heappop(A)
heapq.heappush(A,-(-a//2))
print((-sum(A))) | p02912 |
from decimal import Decimal
from bisect import bisect
n,m=list(map(int,input().split()))
lst=sorted(map(Decimal, input().split()))
while m>0:
p=lst[-1]
index=bisect(lst,p/2)
for i in range(n-1,index-1,-1):
if m>0:
lst[i]=lst[i]/2
m-=1
lst=sorted(lst)
if lst[-1]<1:
break
ans=0
for i in lst:
ans+=i//1
print(ans) | import sys
input=sys.stdin.readline
from decimal import Decimal
from bisect import bisect
n,m=list(map(int,input().split()))
lst=sorted(map(Decimal, input().split()))
while m>0:
p=lst[-1]
index=bisect(lst,p/2)
for i in range(n-1,index-1,-1):
if m>0:
lst[i]=lst[i]/2
m-=1
lst=sorted(lst)
if lst[-1]<1:
break
ans=0
for i in lst:
ans+=i//1
print(ans) | p02912 |
import os
import math
def main():
n,m = list(map(int, input().split()))
a_list = list(map(int, input().split()))
a_list.sort(reverse=True)
for i in range(m):
max_num = a_list[0]
a_list[0] = math.floor(max_num/(2))
a_list.sort(reverse=True)
print((sum(a_list)))
if __name__ == "__main__":
main()
| import os
import math
import heapq
def main():
n,m = list(map(int, input().split()))
a_list = list([int(x)*(-1) for x in input().split()])
heapq.heapify(a_list)
for i in range(m):
max_num = heapq.heappop(a_list)*(-1)
heapq.heappush(a_list, (max_num//2)*(-1))
print(((-1)*sum(a_list)))
if __name__ == "__main__":
main()
| p02912 |
from heapq import heapify,heappop,heappush
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
A=list([x*(-1) for x in A])
heapify(A)
while(M>0):
temp=heappop(A)*-1
heappush(A,temp//2*-1)
M-=1
print((sum(A)*-1)) | from heapq import heapify,heappop,heappush
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 |
import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
for _ in range(m):
i=a.index(max(a))
a[i]=int(a[i]/2)
print((sum(a))) | import sys
import heapq
input=sys.stdin.readline
n,m=list(map(int,input().split()))
a=list([int(x)*(-1) for x in input().split()])
heapq.heapify(a)
for _ in range(m):
mina=int(heapq.heappop(a)/2)
heapq.heappush(a,mina)
print((sum(a)*(-1))) | p02912 |
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(m):
max_idx = a.index(max(a))
a[max_idx] = a[max_idx] // 2
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)
for i in range(m):
tar = heapq.heappop(a)
ins = ((tar*-1) // 2)*-1
heapq.heappush(a, ins)
a = list([x*-1 for x in a])
print((sum(a)))
| p02912 |
import bisect
n, m = list(map(int, input().split()))
a = sorted([int(i) for i in input().split()])
for i in range(m):
tmp = a.pop() // 2
idx = bisect.bisect_left(a, tmp)
a.insert(idx, tmp)
print((sum(a))) | import heapq
n, m = list(map(int, input().split()))
a = [int(i) * (-1) for i in input().split()]
heapq.heapify(a)
for i in range(m):
tmp = (heapq.heappop(a) * (-1)) // 2
heapq.heappush(a, tmp * (-1))
print((sum(a) * (-1)))
| p02912 |
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(m):
num = a.index(max(a))
a[num] = max(a) // 2
print((sum(a))) | from heapq import heappop,heappush,heapify
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A_minus = [-a for a in A]
heapify(A_minus)
for _ in range(M):
heappush(A_minus, -((-heappop(A_minus)) // 2))
ans = -sum(A_minus)
print((int(ans))) | p02912 |
import heapq
N,M = list(map(int,input().split()))
list_A = list([int(x)*(-1) for x in input().split()])
#print(list_A)
for i in range(M):
heapq.heapify(list_A)
target = heapq.heappop(list_A)
#print("after heappop",list_A)
'''負の要素の切り捨て除算は切り捨てがマイナスの方に
行くため少しだけややこしい。'''
heapq.heappush(list_A, (-1)*((-target) // 2)) # 要素の挿入
#print("No.",i,"change finished",list_A)
print((-sum(list_A)))
| import heapq
N,M = list(map(int,input().split()))
list_A = list([int(x)*(-1) for x in input().split()])
#print(list_A)
heapq.heapify(list_A)
for i in range(M):
target = heapq.heappop(list_A)
#print("after heappop",list_A)
'''負の要素の切り捨て除算は切り捨てがマイナスの方に
行くため少しだけややこしい。'''
heapq.heappush(list_A, (-1)*((-target) // 2)) # 要素の挿入
#print("No.",i,"change finished",list_A)
print((-sum(list_A)))
| p02912 |
N,M=list(map(int, input().split()))
A=list(map(int, input().split()))
for i in range(M):
amax = A.index(max(A))
A[amax] = A[amax] // 2
print((sum(A)))
| import heapq as hq
N,M=list(map(int, input().split()))
A=list(map(int, input().split()))
#ヒープキューのために符号逆転
A=list([x * (-1) for x in A])
hq.heapify(A)
for i in range(M):
a = hq.heappop(A) * (-1)
hq.heappush(A, a // 2 * (-1))
print((sum(A) * (-1))) | p02912 |
import bisect
N, M = list(map(int, input().split(' ')))
As = list(map(int, input().split(' ')))
# osoi
As = sorted([-a for a in As])
while M:
hoge = -As.pop(0) // 2
M -= 1
while M and As and hoge < As[1]:
hoge = hoge // 2
M -= 1
bisect.insort(As, -hoge)
print((-sum(As)))
| import math
import heapq
n, k = list(map(int, input().split(' ')))
aaa = list(map(int, input().split(' ')))
aaa = [-a for a in aaa]
heapq.heapify(aaa)
for i in range(k): # TLE?
t = heapq.heappop(aaa)
t = math.ceil(t/2)
heapq.heappush(aaa, t)
print((-sum(aaa)))
| p02912 |
# https://atcoder.jp/contests/abc141/tasks/abc141_d
from copy import deepcopy
from heapq import heappop, heappush, heapify
n, m = list(map(int, input().split()))
nums = [-int(i) for i in input().split()]
heapify(nums)
def check(nums, money, m):
while m:
m -= 1
item = -1 * heappop(nums)
item //= 2
nums.append(-1 * item)
pay = 0
for num in nums:
pay += -1 * num
if pay > money:
return False
return True
l = 0
r = -1 * sum(nums)
ans = r
while l <= r:
items = deepcopy(nums)
mid = (l + r) // 2
if check(items, mid, m):
ans = min(ans, mid)
r = mid - 1
else:
l = mid + 1
print(ans) | # https://atcoder.jp/contests/abc141/tasks/abc141_d
from copy import deepcopy
from heapq import heappop, heappush, heapify
n, m = list(map(int, input().split()))
items = [-int(i) for i in input().split()]
heapify(items)
while m:
m -= 1
item = -1 * heappop(items)
item //= 2
heappush(items, -1 * item)
pay = 0
for i in items:
pay += -1 * i
print(pay) | p02912 |
#coding: utf-8
import math
import heapq
import bisect
MOD = 10**9+7
N,M = list(map(int, input().split()))
# 複数個の数値を、intの配列として取得
A = list(map(int, input().split()))
A.sort()
for i in range(M):
d = A.pop(-1)/2
bisect.insort_left(A,d)
ans=0
for i in range(N):
ans+=math.floor(A[i])
print(ans) | #coding: utf-8
import math
import heapq
import bisect
MOD = 10**9+7
N,M = list(map(int, input().split()))
# 複数個の数値を、intの配列として取得
A = list(map(int, input().split()))
A = list([x * (-1) for x in A])
heapq.heapify(A)
for i in range(M):
x = heapq.heappop(A)
heapq.heappush(A,x/2)
ans=0
for a in A:
ans+=math.floor(-a)
print(ans) | p02912 |
n,m=list(map(int,input().split()))
a=[int(i) for i in input().split()]
while m>0:
b=max(a)
a.remove(b)
a.append(b//2)
m-=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,-(abs(k)//2))
print((-sum(a))) | p02912 |
#標準入力からソートまで
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
#Aの中で一番でかいのをdiscountしてまた並び替え
import bisect
for i in range(M):
tmp = A.pop(N-1) // 2
bisect.insort_left(A, tmp)
print((sum(A))) | #標準入力からソートまで
N, M = list(map(int, input().split()))
A = list([int(x) * (-1) for x in input().split()])
#Aの中で一番でかいのをdiscountしてまた並び替え
#優先度付きqueuemを使う
import heapq
heapq.heapify(A)
for i in range(M):
tmp = (-1) * heapq.heappop(A) // 2
heapq.heappush(A, tmp * (-1))
print((-sum(A))) | p02912 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(M):
A[A.index(max(A))] //= 2
print((sum(A))) | import heapq
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
a = []
for i in A:
heapq.heappush(a, -i)
for i in range(M):
heapq.heappush(a, -(-heapq.heappop(a) // 2))
print((-sum(a))) | p02912 |
import heapq
N, M = list(map(int, input().split(" ")))
A = [-int(_) for _ in input().split(" ")]
for i in range(M):
heapq.heapify(A)
heapq.heappush(A, -(-heapq.heappop(A)// 2))
print((-sum(A))) | import heapq
N, M = list(map(int, input().split(" ")))
A = [-int(_) for _ in input().split(" ")]
heapq.heapify(A)
for i in range(M):
heapq.heappush(A, -(-heapq.heappop(A)// 2))
print((-sum(A))) | p02912 |
def calc_half(n):
return int(n / 2)
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
a_half = list(map(calc_half, a))
for m_num in range(m):
max_index = a.index(max(a))
a[max_index] = a_half[max_index]
a_half[max_index] = calc_half(a_half[max_index])
print((sum(a)))
| import heapq
def calc_Inversion(num):
return num * -1
n, m = list(map(int, input().split()))
a = list(map(calc_Inversion, list(map(int, input().split()))))
heapq.heapify(a)
for m_num in range(m):
heapq.heappush(a, int(heapq.heappop(a) / 2))
print((sum(a) * -1))
| p02912 |
import bisect
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
for i in range(m):
tmp_max = a.pop()
bisect.insort(a, tmp_max // 2)
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)
for _ in range(m):
min = ((heapq.heappop(a) * (-1)) // 2) * (-1)
heapq.heappush(a, min)
print((sum(a)*(-1))) | p02912 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)
##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力
# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと
##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順
# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順
def inputInt(): return int(eval(input()))
def inputMap(): return list(map(int, input().split()))
def inputList(): return list(map(int, input().split()))
def main():
N,M = inputMap()
A = inputList()
if len(A) == 1:
print((A[0] // (2**M)))
sys.exit()
A.sort()
A = A[::-1]
ans = 0
A_new = []
mimi = -1
for i in range(10000000000000000000):
for i,val in enumerate(A):
if i == len(A)-1:
A_new.append(val)
break
if mimi < val and M > 0:
flg = False
for j in range(1,M+1):
if M - j != 0:
tmp = val // (2**j)
if tmp < A[i+1] or tmp < mimi:
M -= j
A_new.append(tmp)
flg = True
if mimi == -1:
mimi = tmp
break
if flg == False:
tmp = val // (2**M)
M = 0
A_new.append(tmp)
else:
A_new.append(val)
#print(A_new)
#A = copy.deepcopy(A_new)
A = A_new
A.sort()
A = A[::-1]
A_new = []
mimi = -1
if M == 0:
break
#print(A)
ans = 0
for i in A:
ans += i
print(ans)
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)
##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力
# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと
##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順
# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順
def inputInt(): return int(eval(input()))
def inputMap(): return list(map(int, input().split()))
def inputList(): return list(map(int, input().split()))
def main():
N,M = inputMap()
A = inputList()
if len(A) == 1:
print((A[0] // (2**M)))
sys.exit()
A.sort()
A = A[::-1]
ans = 0
A_new = []
mimi = -1
for i in range(1000000000000):
for i,val in enumerate(A):
if i == len(A)-1:
A_new.append(val)
break
if mimi < val and M > 0:
flg = False
for j in range(1,M+1):
if M - j != 0:
tmp = val // (2**j)
if tmp < A[i+1] or tmp < mimi:
M -= j
A_new.append(tmp)
flg = True
if mimi == -1:
mimi = tmp
break
if flg == False:
tmp = val // (2**M)
M = 0
A_new.append(tmp)
else:
A_new.append(val)
#print(A_new)
#A = copy.deepcopy(A_new)
A = A_new
A.sort()
A = A[::-1]
A_new = []
mimi = -1
if M == 0:
break
#print(A)
ans = 0
for i in A:
ans += i
print(ans)
if __name__ == "__main__":
main()
| p02912 |
import bisect
N,M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
for m in range(M):
i = bisect.bisect_left(A, A[-1]/2)
A.insert(i, A[-1]/2)
A.pop()
print((sum(map(int, A)))) | from heapq import heappush, heappop, heapify
N,M = list(map(int, input().split()))
A = list(map(int, input().split()))
heap = [-a for a in A]
heapify(heap)
for i in range(M):
hmax = heappop(heap)
heappush(heap, hmax/2)
print((sum([int(-x) for x in heap]))) | p02912 |
from heapq import heappush, heappop, heapify
N,M = list(map(int, input().split()))
A = list(map(int, input().split()))
heap = [-a for a in A]
heapify(heap)
for i in range(M):
hmax = heappop(heap)
heappush(heap, hmax/2)
print((sum([int(-x) for x in heap]))) | from heapq import heapify, heappush, heappop
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A = list([-x for x in A])
heapify(A)
for i in range(M):
mx = heappop(A)
heappush(A, (-1)*(-mx//2))
A = list([-x for x in A])
print((sum(A))) | p02912 |
def d_powerful_discount_tickets():
import heapq
N, M = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
# 参考: https://juppy.hatenablog.com/entry/2019/04/05/蟻本_Python_プライオリティキュー_2_heapq_競技プログラミン
def _heappush_max(heap, item):
heap.append(item)
heapq._siftdown_max(heap, 0, len(heap) - 1)
def _heappop_max(heap):
"""Maxheap version of a heappop."""
lastelt = heap.pop() # raises appropriate IndexError if heap is empty
if heap:
returnitem = heap[0]
heap[0] = lastelt
heapq._siftup_max(heap, 0)
return returnitem
return lastelt
heapq._heapify_max(A)
for _ in range(M):
_heappush_max(A, _heappop_max(A) // 2)
return sum(A)
print((d_powerful_discount_tickets())) | def d_powerful_discount_tickets():
from heapq import heapify, heappop, heappush
N, M = [int(i) for i in input().split()]
A = [-int(i) for i in input().split()]
heapify(A)
for _ in range(M):
heappush(A, -(-heappop(A) // 2))
return -sum(A)
print((d_powerful_discount_tickets())) | p02912 |
import bisect
[n, m] = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a.sort()
for i in range(m):
tmp = a.pop(-1)
bisect.insort(a, int(tmp / 2))
print((sum(a))) | import heapq
[n, m] = [int(i) for i in input().split()]
a = [-1 * int(i) for i in input().split()]
heapq.heapify(a)
for i in range(m):
tmp = heapq.heappop(a)
heapq.heappush(a, int(tmp / 2))
print((-1 * 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 = -(-a / 2.0)
heapq.heappush(A, a)
amount = 0
for a in A:
amount += math.floor(-a)
print(amount) | 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) | p02912 |
N,M = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
for i in range(M):
index = A.index(max(A))
A[index] = A[index]//2
print((sum(A)))
| import heapq
N,M = (int(i) for i in input().split())
A = [int(i) * (-1) for i in input().split()]
heapq.heapify(A)
for i in range(M):
tmp = heapq.heappop(A)
tmp = ((tmp * -1)//2) * -1
heapq.heappush(A,tmp)
print(((-1)*sum(A)))
| p02912 |
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
for i in range(m):
x=a.index(max(a))
a[x]//=2
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)
for _ in range(m):
x=heapq.heappop(a)
x=((x*(-1))//2)*(-1)
heapq.heappush(a,x)
print((sum(a)*(-1)))
| p02912 |
obj = input().strip().split(' ')
N, M = list(map(int, obj))
obj = input().strip().split(' ')
A_list = list(map(int, obj))
val_list = sorted(A_list, reverse=True)
can_insert = False
for _ in range(M):
val = val_list.pop(0) // 2
for i, v in enumerate(val_list):
if val >= v:
val_list.insert(i, val)
can_insert = True
break
if not can_insert:
val_list.append(val)
print((sum(val_list)))
| from heapq import heappush, heappop, heapify
obj = input().strip().split(' ')
N, M = list(map(int, obj))
obj = input().strip().split(' ')
val_list = [-1 * item for item in list(map(int, obj))]
heapify(val_list)
for _ in range(M):
val = (-1) * ((heappop(val_list) * (-1)) // 2)
heappush(val_list, val)
print((-1 * sum(val_list)))
| p02912 |
# -*- coding: utf-8 -*-
def ans() :
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(m):
j = a.index(max(a))
a[j] = a[j] >> 1
print((sum(a)))
if __name__ == '__main__':
ans() | # -*- coding: utf-8 -*-
import heapq
def ans() :
n, m = list(map(int, input().split()))
aa = list(map(int, input().split()))
a = []
for i in aa:
heapq.heappush(a, int(i) * (-1))
for i in range(m):
head = heapq.heappop(a)
head = (-1) * (-head // 2)
heapq.heappush(a, head)
print((-sum(a)))
if __name__ == '__main__':
ans() | p02912 |
from heapq import heappush, heappop
import math
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
A =list(map(int, input().split()))
Hq = []
for a in A:
heappush(Hq, -a)
for _ in range(m):
max = -heappop(Hq)
heappush(Hq, -math.floor(max/2))
print((-sum(Hq))) | from heapq import *
n, m = list(map(int, input().split()))
A = list([int(x)*(-1) for x in input().split()])
heapify(A)
for _ in range(m):
max_a = heappop(A)*(-1)
max_a //= 2
heappush(A, -max_a)
print((-sum(A))) | p02912 |
import os
N,M = (int(x) for x in input().split())
list = list(map(int,input().split()))
ans = 0
for i in range(0,M):
a = list.index(max(list))
list[a] = list[a]//2
for j in list:
ans += j
print(ans)
| import os
import heapq
N,M = (int(x) for x in input().split())
list = [-int(i) for i in input().split()]
heapq.heapify(list)
ans = 0
for i in range(0,M):
a = heapq.heappop(list)
heapq.heappush(list,-((-a)//2))
for j in list:
ans += j*(-1)
print(ans)
| p02912 |
# ABC141 D - Powerful Discount Tickets
from heapq import heappop,heappush,heapify
n,m = list(map(int, input().split()))
a = list(map(float,input().split()))
a_minus = [-x for x in a]
heapify(a_minus)
for _ in range(m):
heappush(a_minus,-((-heappop(a_minus))//2))
ans = -sum(a_minus)
print((int(ans)))
| import heapq as hp
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
a=[-x for x in a]
hp.heapify(a)
for i in range(m):
t=hp.heappop(a)
hp.heappush(a,-(-t//2))
print((-sum(a)))
| p02912 |
N,M=list(map(int,input().split()))
List = list(map(int,input().split()))
for i in range(M):
MaxY = max(List)
Y = List.index(MaxY)
List[Y] = MaxY //2
Sum = 0
for j in range(N):
Sum += List[j]
print(Sum) | 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):
tmp_min = heapq.heappop(a)
heapq.heappush(a, (-1)*(-tmp_min//2))
print((-sum(a))) | p02912 |
n,m = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(m):
k = A.index(max(A))
A[k] //= 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 i in range(m):
tmp_min = heapq.heappop(A)
heapq.heappush(A, (-1)*(-tmp_min//2))
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 i in range(m):
tmp_min = heapq.heappop(A)
heapq.heappush(A, (-1)*(-tmp_min//2))
print((-sum(A))) | import sys
import heapq
def input():
return sys.stdin.readline().strip()
def main():
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
heap = []
for a in A:
heapq.heappush(heap, -1 * a)
for i in range(M):
a = heapq.heappop(heap)
a *= -1
a //= 2
a *= -1
heapq.heappush(heap, a)
print((sum(heap) * (-1)))
if __name__ == "__main__":
main()
| p02912 |
import heapq
import math
n, m = list(map(int, input().split()))
a = [-1 * int(i) for i in input().split()]
heapq.heapify(a)
for _ in range(m):
b = heapq.heappop(a)
heapq.heappush(a, math.ceil(b / 2))
print((-1 * sum(a))) | import heapq
import math
n, m = list(map(int, input().split()))
a = []
for i in input().split():
a.append(-1 * int(i))
heapq.heapify(a)
for _ in range(m):
b = heapq.heappop(a)
heapq.heappush(a, math.ceil(b / 2))
print((-1 * sum(a))) | p02912 |
# -*- coding: utf-8 -*-
import math
def main():
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
for _ in range(M):
MAX = max(A)
tmpi = A.index(MAX)
A[tmpi] = math.floor(A[tmpi]-(MAX/2))
print((sum(A)))
if __name__ == '__main__':
main() | # -*- coding: utf-8 -*-
import heapq as hq
def main():
N,M = list(map(int,input().split()))
A=[-int(j) for j in input().split()]
hq.heapify(A)
for _ in range(M):
tmp = hq.heappop(A)
hq.heappush(A,(-((-tmp)//2)))
print((-sum(A)))
if __name__ == '__main__':
main() | p02912 |
# ABC-141-D
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))) | # ABC-141-D
# https://qiita.com/ellio08/items/fe52a9eb9499b7060ed6
import heapq
N, M = list(map(int, input().split()))
A = [i * (-1) for i in list(map(int, input().split()))]
heapq.heapify(A)
for _ in range(M):
tmp = heapq.heappop(A) * (-1)
heapq.heappush(A, (tmp//2)*-1)
# これだとTLEになる。
# for _ in range(M):
# A[A.index(max(A))] //= 2
print((sum(A)*-1)) | p02912 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
Q = []
for i in range(N):
Q.append(max(A))
A.remove(max(A))
for j in range(M):
Q[0] //= 2
for k in range(1, N-1):
if Q[0] <= Q[k] and Q[0] >= Q[k+1]:
Q.insert(k+1, Q[0])
Q.remove(Q[0])
if Q[0] < Q[N-1]:
Q.append(Q[0])
Q.remove(Q[0])
S = 0
for k in range(N):
S += Q[k]
print(S) | import heapq
pq = []
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in A:
heapq.heappush(pq, -i)
for i in range(M):
x = pq[0]
heapq.heappop(pq)
heapq.heappush(pq, -((-x)//2))
print((-sum(pq))) | p02912 |
n, m = list(map(int, input().split()))
a = [int(s) for s in input().split()]
# m回だけ最も大きい数字を2で割る
for i in range(m):
a[a.index(max(a))] //= 2
print((sum(a[i] for i in range(n))))
| 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 _ in range(m):
x = heapq.heappop(a)
heapq.heappush(a, (-x//2)*(-1))
print((-sum(a)))
| p02912 |
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)
while(m):
heapq.heapreplace(a, int(a[0] / 2))
m -= 1
res = -sum(a)
print(res) | 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)
while(m):
heapq.heapreplace(a, -(-a[0] // 2))
m -= 1
res = -sum(a)
print(res) | p02912 |
# D - Powerful Discount Tickets
n,m= list(map(int, input().split()))
list = [int(s) for s in input().split()]
list.sort(reverse=True)
i = 0
while (m != 0):
list[i] = (int)(list[i] / 2)
m = m - 1
if len(list) == 0:
continue
else:
list.sort(reverse=True)
print((sum(list))) | # D - Powerful Discount Tickets
import heapq
n,m= list(map(int, input().split()))
a = [int(s) for s in input().split()]
a = list([x*(-1) for x in a]) # 各要素を-1倍
heapq.heapify(a)
while (m != 0):
heapq.heappush(a, (int)(heapq.heappop(a) / 2))
m = m - 1
print((-sum(a))) | p02912 |
N, M = list(map(int, input().split()))
lst = list(map(int, input().split()))
for _ in range(M):
n = max(lst)
idx = lst.index(n)
lst[idx] = n // 2
print((sum(lst))) | import heapq
N, M = list(map(int, input().split()))
lst = [int(x) * -1 for x in input().split()]
heapq.heapify(lst)
for _ in range(M):
n = heapq.heappop(lst)
n = n * -1 // 2 * -1
heapq.heappush(lst, n)
print((sum(lst) * -1)) | p02912 |
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(m):
a = sorted(a)[::-1]
a[0] //= 2
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):
ref = heapq.heappop(a)*-1
ref //= 2
heapq.heappush(a, -ref)
print((sum(a)*-1)) | p02912 |
import math
def find_index(l, x, default=-1):
return l.index(x) if x in l else default
def main():
n,m = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(m):
maximum = max(A)
index = find_index(A,maximum)
A[index] = int(math.floor(maximum/2))
print((sum(A)))
if __name__ == '__main__':
main()
| import heapq
def main():
n,m = list(map(int, input().split()))
A = list([-int(x) for x in input().split()])
heapq.heapify(A)
for i in range(m):
temp_min = heapq.heappop(A)
heapq.heappush(A, (-1)*(-temp_min//2))
print((-sum(A)))
if __name__ == '__main__':
main()
| p02912 |
import math
N,M = list(map(int, input().split()))
L = list(map(int, input().split()))
L = sorted(L,reverse=True)
for i in range(0,M):
L[0] = int(math.floor(L[0] / 2))
L = sorted(L,reverse=True)
print((sum(L))) | import heapq
N,M = list(map(int, input().split()))
L = [-int(i) for i in input().split()]
heapq.heapify(L)
for i in range(M):
h = -(-heapq.heappop(L) // 2)
heapq.heappush(L,h)
print((-sum(L))) | p02912 |
import heapq
N, M = [int(s) for s in input().split()]
A = [int(s) for s in input().split()]
hpq = list([-1 * x for x in A])
for i in range(M):
heapq.heapify(hpq)
x = heapq.heappop(hpq)
heapq.heappush(hpq, x / 2)
print((sum([int(-1 * x) for x in hpq]))) | import heapq
N, M = [int(s) for s in input().split()]
A = [int(s) for s in input().split()]
hpq = list([-1 * x for x in A])
heapq.heapify(hpq)
for i in range(M):
x = heapq.heappop(hpq)
heapq.heappush(hpq, x / 2)
print((sum([int(-1 * x) for x in hpq]))) | p02912 |
n,m=list(map(int,input().split()))
L=list(map(int,input().split()))
import bisect
from collections import deque
L.sort()
Ld=deque(L)
for i in range(m):
x=L.pop()//2
y=bisect.bisect_left(L,x)
L.insert(y,x)
print((sum(L))) | n,m=list(map(int,input().split()))
L=list(map(int,input().split()))
Lh=list([x*(-1) for x in L])
import heapq
#heapqは置き直さなくてOK
heapq.heapify(Lh)
for _ in range(m):
x=heapq.heappop(Lh)
heapq.heappush(Lh,(x+1)//2)#負の数の割り算のため+1
print((sum(Lh)*(-1))) | p02912 |
import heapq
import math
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
A.sort()
logof2=[0]*N
mi=0
buf=0
#print(A)
for i in range(N):
A[i]=-A[i] #heapqは実装上最初値しか取り出さないので、数列を-1倍し、最小値が最大に当たるようにする
heapq.heapify(A)#priority_que化
for i in range(M):
buf=heapq.heappop(A) #最大値を取り出すことに相当
buf=(-buf)/2 #切り捨て(floor)の挙動は負数の時おかしくなるので一旦正値に変換して計算し
buf=-buf #負数に戻す
heapq.heappush(A,buf) #
#print(A)
for i in range(N):
mi=mi+math.floor(-1*A[i]) #残った要素ごとの足し算に相当する
print(mi)
| import heapq
import math
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
A.sort()
logof2=[0]*N
mi=0
buf=0
#print(A)
for i in range(N):
A[i]=-A[i] #heapqは実装上最初値しか取り出さないので、数列を-1倍し、最小値が最大に当たるようにする
heapq.heapify(A)#priority_que化
for i in range(M):
buf=heapq.heappop(A) #最大値を取り出すことに相当
buf=-(-buf)/2 #切り捨て(floor)の挙動は負数の時おかしくなるので一旦正値に変換して計算し
#buf=-buf #負数に戻す
heapq.heappush(A,buf) #
#print(A)
for i in range(N):
mi=mi+math.floor(-1*A[i]) #残った要素ごとの足し算に相当する
print(mi)
| p02912 |
import heapq
import math
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
A.sort()
logof2=[0]*N
mi=0
buf=0
#print(A)
for i in range(N):
A[i]=-A[i] #heapqは実装上最初値しか取り出さないので、数列を-1倍し、最小値が最大に当たるようにする
heapq.heapify(A)#priority_que化
for i in range(M):
buf=heapq.heappop(A) #最大値を取り出すことに相当
buf=-(-buf)/2 #切り捨て(floor)の挙動は負数の時おかしくなるので一旦正値に変換して計算し
#buf=-buf #負数に戻す
heapq.heappush(A,buf) #
#print(A)
for i in range(N):
mi=mi+math.floor(-1*A[i]) #残った要素ごとの足し算に相当する
print(mi)
| import heapq
import math
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
A.sort()
logof2=[0]*N
mi=0
buf=0
#print(A)
for i in range(N):
A[i]=-A[i] #heapqは実装上最初値しか取り出さないので、数列を-1倍し、最小値が最大に当たるようにする
heapq.heapify(A)#priority_que化
for i in range(M):
buf=heapq.heappop(A) #最大値を取り出すことに相当
buf=buf/2 #切り捨て(floor)の挙動は負数の時おかしくなるので一旦正値に変換して計算し
heapq.heappush(A,buf) #
#print(A)
for i in range(N):
mi=mi+math.floor(-1*A[i]) #残った要素ごとの足し算に相当する
print(mi)
| p02912 |
n,m = list(map(int,input().split()))
arr= list(map(int,input().split()))
while m > 0:
arr[arr.index(max(arr))] = max(arr)//2
m -= 1
print((sum(arr))) | import heapq
n,m = list(map(int,input().split()))
arr= list([int(x)*(-1) for x in input().split()])
heapq.heapify(arr)
for i in range(m):
d = heapq.heappop(arr)
heapq.heappush(arr,-( -d//2))
print((sum(arr)*-1)) | p02912 |
from collections import deque
N,M=list(map(int,input().split()))
A=deque([int(_) for _ in input().split()])
for m in range(M):
a=max(A)
A.remove(a)
A.append(a//2)
print((sum(A))) | import heapq
N,M=list(map(int,input().split()))
A=[-int(_) for _ in input().split()]
heapq.heapify(A)
for _ in range(M):
a=heapq.heappop(A)
heapq.heappush(A,-((-a)//2))
print((-sum(A))) | p02912 |
import math
N, M = list(map(int, input().split()))
item_list = list(map(int, input().split()))
# 割引は出来るだけする
for i in range(M):
item_list[item_list.index(max(item_list))] = math.floor(max(item_list) / 2)
print((sum(item_list))) | import heapq
N, M = list(map(int, input().split()))
item_list = list([int(x)*(-1) for x in input().split()])
heapq.heapify(item_list)
# 割引は出来るだけする
for i in range(M):
temp_min = heapq.heappop(item_list)
heapq.heappush(item_list, (-1)*(-temp_min//2))
print((-sum(item_list))) | p02912 |
import math
n,m = list(map(int,input().split()))
price = list(map(int,input().split()))
price.sort(reverse=True)
while m != 0:
tmp = max(price)
tmp = tmp//2
price[price.index(max(price))] = tmp
m -= 1
print((sum(price))) | import heapq
n,m = list(map(int,input().split()))
p = list(map(int,input().split()))
price = [x*(-1) for x in p]
heapq.heapify(price)
while m != 0:
max_price = heapq.heappop(price)*(-1)
heapq.heappush(price,(max_price//2)*(-1))
m -= 1
print((sum(price)*(-1))) | p02912 |
while True:
n = int(eval(input()))
if n == 0:
break
ice = [int(eval(input())) for _ in range(n)]
for i in range(10):
print(("*"*ice.count(i) + "-"*(ice.count(i)==0))) | while True:
n = int(eval(input()))
if n == 0:
break
ice = [int(eval(input())) for _ in range(n)]
for i in range(10):
nums = ice.count(i)
print(("*"*nums + "-"*(nums==0))) | p00219 |
while True:
n=int(eval(input()))
x=[0 for i in range(10)]
if n==0:
break
for i in range(n):
a=int(eval(input()))
if a==0:
x[0]+=1
elif a==1:
x[1]+=1
elif a==2:
x[2]+=1
elif a==3:
x[3]+=1
elif a==4:
x[4]+=1
elif a==5:
x[5]+=1
elif a==6:
x[6]+=1
elif a==7:
x[7]+=1
elif a==8:
x[8]+=1
else:
x[9]+=1
for i in range(10):
if x[i]==0:
print(('{}'.format('-')))
else:
print(('{}'.format(x[i]*'*')))
| while 1:
n = int(eval(input()))
if n == 0:
break
x = [0 for i in range(10)]
for i in range(n):
c = int(eval(input()))
x[c] += 1
for i in range(10):
count = '*' * x[i]
if len(count) == 0:
print("-")
else:
print(count)
| p00219 |
def main():
print((input()[::2]))
if __name__ == '__main__':
main()
| def main():
print((input()[0::2]))
if __name__ == '__main__':
main()
| p03610 |
print("".join(map(str, [c for i,c in enumerate(input()) if i % 2 == 0])))
| print("".join([c for i,c in enumerate(input()) if i % 2 == 0]))
| p03610 |
print((input()[::2])) | def main():
print((input()[::2]))
if __name__ == '__main__':
main()
| p03610 |
import sys
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
S = LS2()
ans = ''
for i in range(0,len(S),2):
ans += S[i]
print(ans)
| import sys
def S(): return sys.stdin.readline().rstrip()
S = S()
print((S[::2]))
| p03610 |
s = input()
ans = ''
for i in range(len(s)):
if i & 1 == 0:
ans += s[i]
print(ans)
| print((input()[::2])) | p03610 |
s = input()
print("".join([c for i, c in enumerate(s) if (i + 1) % 2 == 1]))
| print("".join([c for i, c in enumerate(input()) if (i + 1) % 2 == 1]))
| p03610 |
s = input()
for i in range(len(s)):
if i % 2 == 0:
print(s[i], end='')
print()
| print((input()[::2]))
| p03610 |
s = input()[::2]
print(s) | print((input()[::2])) | p03610 |
import sys
coins = [1,5,10,50,100,500]
for i in sys.stdin:
if int(i) == 0:
break
n =1000-int(i)
c = [ i for i in range(n+1) ]
for i in range(len(coins)):
coin = coins[i]
if coin <= n:
c[coin] = 1
coins.append(coin)
for coin in coins:
for p in range(coin+1, n+1):
minc = c[p]
if minc == 1:
continue
c[p] = c[p-coin]+1 if minc > c[p-coin] + 1 else minc
print((c[n])) | import sys
coins = [500,100,50,10,5,1]
for i in sys.stdin:
if int(i) == 0:
break
n =1000-int(i)
cnt = 0
while n != 0:
for i in range(len(coins)):
if n >= coins[i]:
n = n-coins[i]
break
cnt += 1
print(cnt) | p00444 |
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
accum = [0] * N
for i in range(N):
if i == 0:
accum[i] = A[i]
else:
accum[i] = accum[i-1] + A[i]
B = []
for l in range(N):
for r in range(l, N):
if l == 0:
B.append(accum[r])
else:
B.append(accum[r] - accum[l-1])
ans = 0
for i in range(50, -1, -1):
cnt = 0
nxt_B = []
for b in B:
if b & (1 << i):
cnt += 1
nxt_B.append(b)
if cnt >= K:
ans += 2**i
B = nxt_B
print(ans) |
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
accum = [0] * N
accum[0] = A[0]
for i in range(1,N):
accum[i] = accum[i-1] + A[i]
B = []
for l in range(N):
for r in range(l,N):
if l == 0:
B.append(accum[r])
else:
B.append(accum[r] - accum[l-1])
ans = 0
for i in range(45,-1,-1):
used = []
cnt = 0
for b in B:
if b & (1 << i):
cnt += 1
used.append(b)
if cnt >= K:
ans += pow(2,i)
B = used
print(ans) | p03215 |
import itertools
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
beautiful_num = []
for i in range(N):
temp = 0
for n in a[i:]:
temp += n
beautiful_num.append("{:040b}".format(temp))
ma_b_cnt = 0
target_set = None
for i in range(40):
if target_set is None:
for b in beautiful_num:
if b[i] == "1":
ma_b_cnt += 1
if ma_b_cnt < K:
ma_b_cnt = 0
else:
target_set = set([b for b in beautiful_num if b[i] == "1"])
else:
count = 0
for b in target_set:
if b[i] == 0:
count += 1
if len(target_set) - count >= K:
for b in target_set:
if b[i] == 0:
target_set.remove(b)
else:
break
result = 0
for comb in itertools.combinations(target_set, K):
temp = bin(int(comb[0], 2))
for b in comb:
temp = bin(int(b, 2) & int(temp, 2))
temp = int(temp, 2)
if temp > result:
result = temp
print(result) | import itertools
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
beautiful_num = []
for i in range(N):
temp = 0
for n in a[i:]:
temp += n
beautiful_num.append("{:040b}".format(temp))
ma_b_cnt = 0
target_set = None
result = 0
for i in range(40):
for b in beautiful_num:
if b[i] == "1":
ma_b_cnt += 1
if ma_b_cnt >= K:
result += 2**(40-i-1)
beautiful_num = [b for b in beautiful_num if b[i] == "1"]
ma_b_cnt = 0
print(result) | p03215 |
import itertools
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
beautiful_num = []
for i in range(N):
temp = 0
for n in a[i:]:
temp += n
beautiful_num.append("{:040b}".format(temp))
ma_b_cnt = 0
target_set = None
result = 0
for i in range(40):
for b in beautiful_num:
if b[i] == "1":
ma_b_cnt += 1
if ma_b_cnt >= K:
result += 2**(40-i-1)
beautiful_num = [b for b in beautiful_num if b[i] == "1"]
ma_b_cnt = 0
print(result) | import itertools
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
beautiful_num = []
for i in range(N):
temp = 0
for n in a[i:]:
temp += n
beautiful_num.append(temp)
ma_b_cnt = 0
target_set = None
result = 0
for i in range(40, -1, -1):
for b in beautiful_num:
if b & 1 << i != 0:
ma_b_cnt += 1
if ma_b_cnt >= K:
result += 2**i
beautiful_num = [b for b in beautiful_num if b & 1 << i != 0]
ma_b_cnt = 0
print(result) | p03215 |
n,k=list(map(int,input().split()))
d=list(map(int,input().split()))
ds = []
for i in range(0,n):
for len in range(1,n-i+1):
sum = 0
for j in range(i,i+len):
sum += d[j]
ds.append(sum)
ds.sort(reverse=True)
for i in range(40,-1,-1):
count = 0
o = []
for dss in ds:
if dss & (1 << i) > 0 :
count += 1
o.append(dss)
if count >= k :
ds = list(o)
sum = ds[0]
for i in range(1,k):
sum = sum & ds[i]
print(sum) | n,k=list(map(int,input().split()))
d=list(map(int,input().split()))
ds = []
for i in range(0,n):
sum = 0
for j in range(i,n):
sum += d[j]
ds.append(sum)
ds.sort(reverse=True)
for i in range(40,-1,-1):
count = 0
o = []
for dss in ds:
if dss & (1 << i) > 0 :
count += 1
o.append(dss)
if count >= k :
ds = list(o)
sum = ds[0]
for i in range(1,k):
sum = sum & ds[i]
print(sum) | p03215 |
from itertools import accumulate
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
C = [0] + list(accumulate(A))
S = []
for i in range(N):
for j in range(i + 1, N + 1):
S.append(C[j] - C[i])
for i in range(64)[::-1]:
tmp = []
for s in S:
if (s >> i) & 1:
tmp.append(s)
if len(tmp) >= K:
S = tmp[:]
res = 2**64 - 1
for i in range(K):
res &= S[i]
print(res) | from itertools import accumulate
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
C = [0] + list(accumulate(A))
S = []
for i in range(N):
for j in range(i + 1, N + 1):
S.append(C[j] - C[i])
for i in range(64)[::-1]:
tmp = []
for s in S:
if (s >> i) & 1:
tmp.append(s)
if len(tmp) >= K:
S = tmp
res = 2**64 - 1
for i in range(K):
res &= S[i]
print(res) | p03215 |
from collections import Counter
def check(ans, s):
ret = 0
for k, v in list(Sumdic.items()):
if ans & k != ans:
continue
ret += v
if ret >= s:
return True
return False
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
sumA = [0]
for i in range(len(A)):
sumA.append(sumA[i] + A[i])
sumdic = [0] * (n * (n + 1) // 2)
kk = 0
for i in range(len(A)):
# print(kk, sumdic)
for j in range(i + 1, len(A) + 1):
tmp = sumA[j] - sumA[i]
sumdic[kk + j - 1 - i] = tmp
# print(i, j)
kk += n - i
# print(A)
# print(Counter(sumdic))
Sumdic = Counter(sumdic)
for i in reversed(list(range(len(format(sumA[-1], "b"))))):
# print(i)
if check(2 ** i, k) is True:
ans = 2 ** i
tmp = i
break
else:
print((0))
exit()
tmp -= 1
while(tmp != -1):
if check(ans + 2 ** tmp, k) is True:
ans += 2 ** tmp
tmp -= 1
print(ans) | def check(ans, s):
ret = 0
for k in sumdic:
if ans & k != ans:
continue
ret += 1
if ret >= s:
return True
return False
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
sumA = [0]
for i in range(len(A)):
sumA.append(sumA[i] + A[i])
sumdic = [0] * (n * (n + 1) // 2)
kk = 0
for i in range(len(A)):
# print(kk, sumdic)
for j in range(i + 1, len(A) + 1):
tmp = sumA[j] - sumA[i]
sumdic[kk + j - 1 - i] = tmp
# print(i, j)
kk += n - i
# print(A)
# print(Counter(sumdic))
# Sumdic = Counter(sumdic)
for i in reversed(list(range(len(format(sumA[-1], "b"))))):
# print(i)
if check(2 ** i, k) is True:
ans = 2 ** i
tmp = i
break
else:
print((0))
exit()
tmp -= 1
while(tmp != -1):
if check(ans + 2 ** tmp, k) is True:
ans += 2 ** tmp
tmp -= 1
print(ans) | p03215 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
import itertools
n, k = list(map(int, input().split()))
a = list(itertools.accumulate(list(map(int, input().split()))))
a = [0] + a
s = []
for i in range(n+1):
for j in range(i,n+1):
s.append(list(format(a[j]-a[i], '050b')))
ret = 0
sel = set(range(n*(n+1)//2))
for i in range(50):
nxt = set([])
for j in sel:
if s[j][i] == '1':
nxt.add(j)
if len(nxt)>=k:
sel = nxt
ret += 2**(49-i)
print(ret) | #!/usr/bin python3
# -*- coding: utf-8 -*-
import itertools
n, k = list(map(int, input().split()))
a = list(itertools.accumulate(list(map(int, input().split()))))
a = [0] + a
s = [None] * (n*(n+1)//2)
cnt = 0
for i in range(n+1):
for j in range(i+1,n+1):
s[cnt] = format(a[j]-a[i], '050b')
cnt += 1
ret = 0
sel = set(range(n*(n+1)//2))
for i in range(50):
nxt = set([])
for j in sel:
if s[j][i] == '1':
nxt.add(j)
if len(nxt)>=k:
sel = nxt
ret += 2**(49-i)
print(ret)
| p03215 |
import copy
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A_sum = [0]
for a in A:
A_sum.append(A_sum[-1]+a)
score = []
for r in range(1,N+1):
for l in range(0,r):
score.append(A_sum[r]-A_sum[l])
max_num = max(score)
i = 0
while(True):
if(2**(i+1)>max_num):
break
else:
i+=1
ans = 0
for j in range(i,-1,-1):
if len(score)<K:
break
count = 0
score_a = []
score_b = []
for k in range(len(score)):
if score[k] >= 2**j:
count += 1
score[k] -= 2**j
score_a.append(score[k])
score_b.append(score[k])
if count >= K:
ans += 2**j
score = copy.deepcopy(score_a)
else:
score = copy.deepcopy(score_b)
print(ans)
| import copy
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A_sum = [0]
for a in A:
A_sum.append(A_sum[-1]+a)
score = []
for r in range(1,N+1):
for l in range(0,r):
score.append(A_sum[r]-A_sum[l])
ans = 0
for i in range(40,-1,-1):
count = 0
score_a = []
for j in score:
if (j & (1<<i)):
count += 1
score_a.append(j)
if count >= K:
ans += (1<<i)
score = copy.deepcopy(score_a)
print(ans)
| p03215 |
import copy
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A_sum = [0]
for a in A:
A_sum.append(A_sum[-1]+a)
score = []
for r in range(1,N+1):
for l in range(0,r):
score.append(A_sum[r]-A_sum[l])
ans = 0
for i in range(40,-1,-1):
count = 0
score_a = []
for j in score:
if (j & (1<<i)):
count += 1
score_a.append(j)
if count >= K:
ans += (1<<i)
score = copy.deepcopy(score_a)
print(ans)
| N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
A_sum = [0]
for a in A:
A_sum.append(A_sum[-1]+a)
score = []
for r in range(1,N+1):
for l in range(0,r):
score.append(A_sum[r]-A_sum[l])
ans = 0
for i in range(40,-1,-1):
count = 0
score_a = []
for j in score:
if (j & (1<<i)):
count += 1
score_a.append(j)
if count >= K:
ans += (1<<i)
score = [i for i in score_a]
print(ans)
| p03215 |
from math import log2
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = [[a[i]] for i in range(n)]
c = list(a)
for i in range(n-1):
for j in range(i+1, n):
b[i].append(a[j]+b[i][-1])
c.append(b[i][-1])
m = 40 #ceil(log2((10**9)*1000))=40よりbit幅を40としておけば十分
ans = 0
for i in range(m, 0, -1):
count = 0
for p in c:
if (ans + 2**(i-1)) & p == ans + 2**(i-1):
count += 1
if count == k:
ans += 2**(i-1)
break
print(ans)
| from math import log2
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = [[a[i]] for i in range(n)]
c = list(a)
for i in range(n-1):
for j in range(i+1, n):
b[i].append(a[j]+b[i][-1])
c.append(b[i][-1])
m = 40 #ceil(log2((10**9)*1000))=40よりbit幅を40としておけば十分
ans = 0
for i in range(m, -1, -1):
log = 2**i
tmp = [x for x in c if x&log==log]
if len(tmp) >= k:
ans += log
c = tmp
print(ans)
| p03215 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
s=set()
for i in range(n):
for j in range(i,n):
s.add(sum(a[i:j+1]))
s=list(s)
x=0
for i in range(40):
x_=x+2**(39-i)
cnt=0
for a in s:
if x_&a==x_:
cnt+=1
if cnt>=k:
x=x_
print(x) | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
s=set()
for i in range(n):
su=0
for j in range(i,n):
su+=a[j]
s.add(su)
s=list(s)
x=0
for i in range(40):
x_=x+2**(39-i)
cnt=0
for a in s:
if x_&a==x_:
cnt+=1
if cnt>=k:
x=x_
print(x) | p03215 |
def count(value, P):
cnt = 0
for p in P:
if p & value == value:
cnt += 1
return cnt
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
P = []
for i in range(N):
for j in range(i+1, N+1):
P.append(sum(A[i:j]))
retval = 0
for idx in range(40, -1, -1):
tmp = retval + 2**idx
if count(tmp, P) >= K:
retval = tmp
print(retval)
if __name__ == "__main__":
main()
| def count(value, P):
cnt = 0
for p in P:
if p & value == value:
cnt += 1
return cnt
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
P = []
for i in range(N):
s = 0
for j in range(i, N):
s += A[j]
P.append(s)
retval = 0
for idx in range(40, -1, -1):
tmp = retval + 2**idx
if count(tmp, P) >= K:
retval = tmp
print(retval)
if __name__ == "__main__":
main()
| p03215 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.