Submission #7525344


Source Code Expand

Copy
#!/usr/bin/env python3

import heapq


def minimize_money(n, m, xs):
    pq = [-x for x in xs]
    heapq.heapify(pq)
    for _ in range(m):
        x = -heapq.heappop(pq)
        new_x = -(x // 2)
        heapq.heappush(pq, new_x)
    res = sum(-y for y in pq)
    return res


def main():
    n, m = (int(z) for z in input().split())
    xs = [int(z) for z in input().split()]
    res = minimize_money(n, m, xs)
    print(res)


if __name__ == "__main__":
    main()

Submission Info

Submission Time
Task D - Powerful Discount Tickets
User hamukichi
Language Python (3.4.3)
Score 400
Code Size 493 Byte
Status AC
Exec Time 164 ms
Memory 14180 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 21 ms 3188 KB
sample_02 AC 18 ms 3060 KB
sample_03 AC 47 ms 3060 KB
sample_04 AC 18 ms 3060 KB
testcase_01 AC 58 ms 9736 KB
testcase_02 AC 87 ms 4044 KB
testcase_03 AC 81 ms 13400 KB
testcase_04 AC 150 ms 14096 KB
testcase_05 AC 37 ms 7808 KB
testcase_06 AC 104 ms 12392 KB
testcase_07 AC 28 ms 5388 KB
testcase_08 AC 62 ms 14096 KB
testcase_09 AC 121 ms 8980 KB
testcase_10 AC 61 ms 4888 KB
testcase_11 AC 101 ms 9348 KB
testcase_12 AC 164 ms 11696 KB
testcase_13 AC 75 ms 3572 KB
testcase_14 AC 126 ms 14148 KB
testcase_15 AC 154 ms 14180 KB
testcase_16 AC 94 ms 4596 KB
testcase_17 AC 18 ms 3060 KB
testcase_18 AC 18 ms 3060 KB
testcase_19 AC 63 ms 14148 KB