212952026-01-12 17:55:31algoproBájital (80 pont)pypy3Wrong answer 12/8078ms31480 KiB
# UUID: 89d3ea0e-3bbb-432b-adad-2e00678cb10b

N,X = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]

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:
    kulonbseg=harmas-szamlalo
    szamlalo=szamlalo+kulonbseg
    harmas=kulonbseg//3
if harmas <= szamlalo:
    print(harmas)
SubtaskSumTestVerdictTimeMemory
base12/80
1Accepted0/039ms19432 KiB
2Wrong answer0/043ms19644 KiB
3Wrong answer0/239ms19624 KiB
4Wrong answer0/243ms19572 KiB
5Wrong answer0/245ms19796 KiB
6Wrong answer0/248ms21044 KiB
7Wrong answer0/448ms21476 KiB
8Wrong answer0/448ms21600 KiB
9Wrong answer0/265ms31216 KiB
10Wrong answer0/276ms31208 KiB
11Wrong answer0/275ms31208 KiB
12Wrong answer0/265ms31216 KiB
13Wrong answer0/267ms31244 KiB
14Wrong answer0/275ms31312 KiB
15Wrong answer0/275ms31284 KiB
16Wrong answer0/265ms31140 KiB
17Wrong answer0/267ms31212 KiB
18Wrong answer0/278ms31104 KiB
19Wrong answer0/274ms31212 KiB
20Wrong answer0/267ms31092 KiB
21Wrong answer0/268ms31212 KiB
22Wrong answer0/275ms31212 KiB
23Wrong answer0/441ms19412 KiB
24Accepted4/437ms19432 KiB
25Wrong answer0/439ms19436 KiB
26Accepted4/464ms31480 KiB
27Wrong answer0/476ms31160 KiB
28Wrong answer0/475ms31212 KiB
29Wrong answer0/465ms31212 KiB
30Accepted2/275ms31212 KiB
31Accepted2/267ms31256 KiB
32Wrong answer0/274ms31284 KiB
33Wrong answer0/264ms31040 KiB