Submission #7531658


Source Code Expand

Copy
import heapq
N,M = 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):
    m = heapq.heappop(A)
    m = -((m*(-1))//2)
    heapq.heappush(A,m)
print(-sum(A))

Submission Info

Submission Time
Task D - Powerful Discount Tickets
User MizukiHashimoto
Language PyPy3 (2.4.0)
Score 400
Code Size 245 Byte
Status AC
Exec Time 415 ms
Memory 72300 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 171 ms 38256 KB
sample_02 AC 167 ms 38256 KB
sample_03 AC 178 ms 38896 KB
sample_04 AC 172 ms 38256 KB
testcase_01 AC 336 ms 59464 KB
testcase_02 AC 292 ms 48348 KB
testcase_03 AC 375 ms 69540 KB
testcase_04 AC 415 ms 71960 KB
testcase_05 AC 276 ms 51020 KB
testcase_06 AC 386 ms 64960 KB
testcase_07 AC 241 ms 46996 KB
testcase_08 AC 354 ms 69784 KB
testcase_09 AC 347 ms 54700 KB
testcase_10 AC 307 ms 51436 KB
testcase_11 AC 333 ms 54692 KB
testcase_12 AC 390 ms 61988 KB
testcase_13 AC 270 ms 45276 KB
testcase_14 AC 324 ms 63972 KB
testcase_15 AC 413 ms 72300 KB
testcase_16 AC 293 ms 48772 KB
testcase_17 AC 174 ms 38256 KB
testcase_18 AC 174 ms 38256 KB
testcase_19 AC 268 ms 63856 KB