Submission #3,115

2023-02-16 14:11:54

python3

Accepted 75/75

108ms

36304 KiB

n=int(input())
fok=[int(i) for i in input().split()]
fok.sort(reverse=True)
lepes=0
for i in range(n):
    if fok[i]+i>lepes:
        lepes=fok[i]+i
print(lepes)

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	17ms	11008 KiB
		2	Accepted	0/0	17ms	11032 KiB
		3	Accepted	0/0	57ms	23152 KiB
		4	Accepted	3/3	17ms	11452 KiB
		5	Accepted	3/3	17ms	11812 KiB
		6	Accepted	3/3	17ms	12036 KiB
		7	Accepted	3/3	17ms	12276 KiB
		8	Accepted	4/4	17ms	12396 KiB
		9	Accepted	4/4	17ms	12620 KiB
		10	Accepted	4/4	17ms	12572 KiB
		11	Accepted	4/4	17ms	12668 KiB
		12	Accepted	4/4	17ms	12768 KiB
		13	Accepted	4/4	97ms	35800 KiB
		14	Accepted	4/4	101ms	36168 KiB
		15	Accepted	5/5	104ms	35912 KiB
		16	Accepted	5/5	97ms	36008 KiB
		17	Accepted	5/5	108ms	36304 KiB
		18	Accepted	4/4	101ms	36184 KiB
		19	Accepted	4/4	98ms	36236 KiB
		20	Accepted	4/4	82ms	34720 KiB
		21	Accepted	4/4	101ms	34480 KiB
		22	Accepted	2/2	107ms	36148 KiB
		23	Accepted	2/2	70ms	16972 KiB