Submission #21,299

2026-01-12 18:01:28

pypy3

Accepted 80/80

76ms

31524 KiB

# UUID: efe30bad-a702-46aa-9793-d8c64a6fe314

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:
    print(harmas)  
else:
    kulonbseg=harmas-szamlalo
    lepes=(kulonbseg+X)//(X+1)
    #szamlalo=szamlalo+kulonbseg
    harmas-=lepes
    print(harmas)  
    #harmas > szamlalo
    #harmas-1, szamlalo+X
#kulonbseg = 10, X=3
#3 lepes

	Sum	Test	Verdict		Time	Memory
base	80/80
		1	Accepted	0/0	43ms	19584 KiB
		2	Accepted	0/0	43ms	19628 KiB
		3	Accepted	2/2	39ms	19480 KiB
		4	Accepted	2/2	39ms	19564 KiB
		5	Accepted	2/2	45ms	19692 KiB
		6	Accepted	2/2	43ms	21144 KiB
		7	Accepted	4/4	46ms	21500 KiB
		8	Accepted	4/4	54ms	21548 KiB
		9	Accepted	2/2	75ms	31212 KiB
		10	Accepted	2/2	67ms	31232 KiB
		11	Accepted	2/2	65ms	31208 KiB
		12	Accepted	2/2	75ms	31192 KiB
		13	Accepted	2/2	75ms	31208 KiB
		14	Accepted	2/2	67ms	31188 KiB
		15	Accepted	2/2	65ms	31216 KiB
		16	Accepted	2/2	75ms	31124 KiB
		17	Accepted	2/2	76ms	31212 KiB
		18	Accepted	2/2	67ms	31152 KiB
		19	Accepted	2/2	75ms	31112 KiB
		20	Accepted	2/2	76ms	31308 KiB
		21	Accepted	2/2	67ms	31256 KiB
		22	Accepted	2/2	75ms	31100 KiB
		23	Accepted	4/4	43ms	19332 KiB
		24	Accepted	4/4	39ms	19428 KiB
		25	Accepted	4/4	45ms	19432 KiB
		26	Accepted	4/4	64ms	31524 KiB
		27	Accepted	4/4	67ms	31040 KiB
		28	Accepted	4/4	75ms	31132 KiB
		29	Accepted	4/4	67ms	31236 KiB
		30	Accepted	2/2	76ms	31044 KiB
		31	Accepted	2/2	67ms	31212 KiB
		32	Accepted	2/2	75ms	31260 KiB
		33	Accepted	2/2	64ms	31116 KiB