Submission #21,301

2026-01-12 18:03:04

pypy3

Accepted 80/80

76ms

31632 KiB

# UUID: f10c6eb4-f2ef-4117-8b69-945ce6e54174

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:
    print(maxi)
    """
    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	19704 KiB
		2	Accepted	0/0	39ms	19612 KiB
		3	Accepted	2/2	43ms	19660 KiB
		4	Accepted	2/2	39ms	19680 KiB
		5	Accepted	2/2	41ms	19700 KiB
		6	Accepted	2/2	50ms	21076 KiB
		7	Accepted	4/4	48ms	21464 KiB
		8	Accepted	4/4	52ms	21480 KiB
		9	Accepted	2/2	76ms	31212 KiB
		10	Accepted	2/2	67ms	31212 KiB
		11	Accepted	2/2	64ms	31192 KiB
		12	Accepted	2/2	75ms	31188 KiB
		13	Accepted	2/2	67ms	31204 KiB
		14	Accepted	2/2	67ms	31304 KiB
		15	Accepted	2/2	75ms	31304 KiB
		16	Accepted	2/2	75ms	31160 KiB
		17	Accepted	2/2	76ms	31168 KiB
		18	Accepted	2/2	68ms	31208 KiB
		19	Accepted	2/2	75ms	31260 KiB
		20	Accepted	2/2	67ms	31208 KiB
		21	Accepted	2/2	76ms	31124 KiB
		22	Accepted	2/2	75ms	31328 KiB
		23	Accepted	4/4	37ms	19332 KiB
		24	Accepted	4/4	37ms	19516 KiB
		25	Accepted	4/4	39ms	19456 KiB
		26	Accepted	4/4	64ms	31632 KiB
		27	Accepted	4/4	76ms	31316 KiB
		28	Accepted	4/4	75ms	31200 KiB
		29	Accepted	4/4	67ms	31152 KiB
		30	Accepted	2/2	67ms	31216 KiB
		31	Accepted	2/2	67ms	31192 KiB
		32	Accepted	2/2	75ms	31124 KiB
		33	Accepted	2/2	75ms	31272 KiB