Submission #16,473

2025-05-02 15:44:22

pypy3

Accepted 100/100

142ms

44388 KiB

# UUID: 0e44d052-2cd7-42f5-a7cf-c32d505f89e9
n,k=[int(x)for x in input().split()]
p=[int(x)for x in input().split()]
if sum(p)==k*n:
	print(0)
elif sum(p)>k*n:
	p.sort()
	p.reverse()
	i=0
	N=sum(p)
	while N>k*n:
			N=N-p[i]+1
			j=i
			i+=1
			#print("i", j)
			#print(p)
			#print(sum(p)/len(p))
	print(j+1)

else:
	print(1)

	Sum	Test	Verdict	Time	Memory
subtask1	0/0
		1	Accepted	39ms	19436 KiB
		2	Accepted	43ms	19436 KiB
subtask2	20/20
		3	Accepted	39ms	19736 KiB
		4	Accepted	39ms	19604 KiB
		5	Accepted	43ms	19396 KiB
		6	Accepted	45ms	19520 KiB
		7	Accepted	39ms	19452 KiB
		8	Accepted	43ms	19436 KiB
		9	Accepted	37ms	19508 KiB
		10	Accepted	43ms	19432 KiB
		11	Accepted	39ms	19440 KiB
		12	Accepted	45ms	19396 KiB
		13	Accepted	39ms	19508 KiB
subtask3	40/40
		14	Accepted	46ms	21476 KiB
		15	Accepted	46ms	21468 KiB
		16	Accepted	50ms	21516 KiB
		17	Accepted	54ms	21424 KiB
		18	Accepted	46ms	21452 KiB
		19	Accepted	46ms	21480 KiB
		20	Accepted	52ms	21480 KiB
		21	Accepted	46ms	19884 KiB
		22	Accepted	52ms	21464 KiB
		23	Accepted	46ms	21520 KiB
		24	Accepted	45ms	21400 KiB
		25	Accepted	54ms	21480 KiB
		26	Accepted	52ms	21480 KiB
subtask4	40/40
		27	Accepted	93ms	43844 KiB
		28	Accepted	128ms	43884 KiB
		29	Accepted	142ms	44128 KiB
		30	Accepted	128ms	44096 KiB
		31	Accepted	141ms	44196 KiB
		32	Accepted	140ms	44388 KiB
		33	Accepted	128ms	44192 KiB
		34	Accepted	128ms	43988 KiB
		35	Accepted	129ms	44204 KiB
		36	Accepted	97ms	41928 KiB
		37	Accepted	92ms	44188 KiB
		38	Accepted	93ms	36460 KiB
		39	Accepted	126ms	43604 KiB
		40	Accepted	136ms	43928 KiB
		41	Accepted	112ms	40348 KiB
		42	Accepted	135ms	43956 KiB
		43	Accepted	111ms	39900 KiB