Submission #22,757 :: njudge

2026-01-15 18:04:44

Gyorsolvasó-verseny

pypy3

Accepted 100/100

72ms

31212 KiB

# UUID: 1d01140a-7ab9-49f1-88b9-bc8a64f893f8
N = int(input())
T = [int(x) for x in input().split()]
legkissebb = min(T)
print(legkissebb)

Subtask		Sum	Test	Verdict		Time	Memory
	subtask1	0/0
			1	Accepted		37ms	19436 KiB
			2	Accepted		45ms	19436 KiB
	subtask2	10/10
			3	Accepted		39ms	19472 KiB
			4	Accepted		39ms	19436 KiB
			5	Accepted		43ms	19376 KiB
			6	Accepted		43ms	19300 KiB
			7	Accepted		43ms	19384 KiB
			8	Accepted		43ms	19352 KiB
			9	Accepted		39ms	19384 KiB
			10	Accepted		37ms	19400 KiB
			11	Accepted		46ms	19412 KiB
			12	Accepted		45ms	19504 KiB
	subtask3	40/40
			13	Accepted		39ms	19620 KiB
			14	Accepted		43ms	19396 KiB
			15	Accepted		43ms	19404 KiB
			16	Accepted		39ms	19688 KiB
			17	Accepted		43ms	19428 KiB
			18	Accepted		39ms	19456 KiB
			19	Accepted		37ms	19272 KiB
			20	Accepted		37ms	19588 KiB
			21	Accepted		43ms	19432 KiB
	subtask4	50/50
			22	Accepted		39ms	19628 KiB
			23	Accepted		52ms	21412 KiB
			24	Accepted		57ms	24068 KiB
			25	Accepted		63ms	31208 KiB
			26	Accepted		61ms	25108 KiB
			27	Accepted		71ms	31212 KiB
			28	Accepted		61ms	30928 KiB
			29	Accepted		46ms	21480 KiB
			30	Accepted		72ms	30376 KiB
			31	Accepted		61ms	31212 KiB