Submission #18555946


Source Code Expand

Copy
import heapq
N,M = map(int,input().split())
A = list(map(lambda x: -int(x),input().split()))

heapq.heapify(A)
for i in range(M):
    q = heapq.heappop(A)
    q = (-q)//2
    heapq.heappush(A,-q)
print(-sum(A))

Submission Info

Submission Time
Task D - Powerful Discount Tickets
User MizukiHashimoto
Language Python (3.8.2)
Score 400
Code Size 221 Byte
Status AC
Exec Time 140 ms
Memory 20344 KB

Judge Result

Set Name All Sample
Score / Max Score 400 / 400 0 / 0
Status
AC × 23
AC × 4
Set Name Test Cases
All sample_01, sample_02, sample_03, sample_04, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15, testcase_16, testcase_17, testcase_18, testcase_19
Sample sample_01, sample_02, sample_03, sample_04
Case Name Status Exec Time Memory
sample_01 AC 22 ms 8916 KB
sample_02 AC 18 ms 8920 KB
sample_03 AC 53 ms 8872 KB
sample_04 AC 26 ms 8980 KB
testcase_01 AC 56 ms 15552 KB
testcase_02 AC 86 ms 9448 KB
testcase_03 AC 75 ms 18884 KB
testcase_04 AC 131 ms 20160 KB
testcase_05 AC 37 ms 13508 KB
testcase_06 AC 96 ms 17928 KB
testcase_07 AC 29 ms 11040 KB
testcase_08 AC 54 ms 20344 KB
testcase_09 AC 109 ms 15936 KB
testcase_10 AC 62 ms 10576 KB
testcase_11 AC 92 ms 16896 KB
testcase_12 AC 140 ms 20224 KB
testcase_13 AC 78 ms 9320 KB
testcase_14 AC 115 ms 19836 KB
testcase_15 AC 124 ms 19864 KB
testcase_16 AC 88 ms 10084 KB
testcase_17 AC 26 ms 8832 KB
testcase_18 AC 23 ms 8824 KB
testcase_19 AC 59 ms 19784 KB