Submission #161851

#TimeUsernameProblemLanguageResultExecution timeMemory
161851boolodifjenulaHindeks (COCI17_hindeks)Cpython 3
30 / 50
1079 ms60448 KiB
n=int(input()) p=0 L=list(map(int,input().split())) i=0 while 1: i+=1 m=0 for j in range(n): if L[j]>=i: m+=1 if m==i: p=i break if p<i: print(p) break
#Verdict Execution timeMemoryGrader output
Fetching results...