212802026-01-12 17:45:38algoproBájital (80 pont)pypy3Wrong answer 12/8098ms31508 KiB
# UUID: 58ecf00e-e114-4d25-bf8a-2df578c1e339

N,X = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
A.sort()
maxi = sum(A)//(X+1)
harmas=0
szamlalo=0

for i in range(len(A)):
    harmas=harmas+A[i]//X
    szamlalo=szamlalo+A[i]%X
if harmas <= szamlalo:
    print(harmas)
SubtaskSumTestVerdictTimeMemory
base12/80
1Accepted0/045ms19412 KiB
2Wrong answer0/043ms19620 KiB
3Wrong answer0/239ms19596 KiB
4Wrong answer0/239ms19648 KiB
5Wrong answer0/241ms19696 KiB
6Wrong answer0/248ms21228 KiB
7Wrong answer0/454ms21444 KiB
8Wrong answer0/454ms21528 KiB
9Wrong answer0/298ms31316 KiB
10Wrong answer0/286ms31212 KiB
11Wrong answer0/296ms31248 KiB
12Wrong answer0/297ms31268 KiB
13Wrong answer0/297ms31176 KiB
14Wrong answer0/286ms31300 KiB
15Wrong answer0/296ms31192 KiB
16Wrong answer0/286ms31208 KiB
17Wrong answer0/286ms31160 KiB
18Wrong answer0/286ms31212 KiB
19Wrong answer0/296ms31180 KiB
20Wrong answer0/296ms31252 KiB
21Wrong answer0/297ms31212 KiB
22Wrong answer0/287ms31284 KiB
23Wrong answer0/445ms19540 KiB
24Accepted4/437ms19524 KiB
25Wrong answer0/446ms19488 KiB
26Accepted4/479ms31508 KiB
27Wrong answer0/497ms31296 KiB
28Wrong answer0/486ms31168 KiB
29Wrong answer0/497ms31212 KiB
30Accepted2/286ms31312 KiB
31Accepted2/287ms31092 KiB
32Wrong answer0/296ms31220 KiB
33Wrong answer0/296ms31212 KiB