Submission #29466033

Source Code Expand

n = int(input())
a, b = map(int, input().split())
c = int(input())
d = [0] * n
for i in range(n):
    d[i] = int(input())
d = sorted(d, reverse=True)
answer = 0
for k in range(n + 1):
    cal_per_dollar = (c + sum(d[0 : k])) // (a + k * b)
    answer = max(answer, cal_per_dollar)
print(answer)

Submission Info

Submission Time
Task C - 最高のピザ (Best Pizza)
User Pro_ktmr
Language PyPy3 (7.3.0)
Score 100
Code Size 307 Byte
Status AC
Exec Time 62 ms
Memory 63328 KiB

Judge Result

Set Name set01 set02 set03 set04 set05
Score / Max Score 20 / 20 20 / 20 20 / 20 20 / 20 20 / 20
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
set01 data1
set02 data2
set03 data3
set04 data4
set05 data5
Case Name Status Exec Time Memory
data1 AC 62 ms 61652 KiB
data2 AC 53 ms 61912 KiB
data3 AC 53 ms 63256 KiB
data4 AC 53 ms 63324 KiB
data5 AC 54 ms 63328 KiB