Submission #161852

#TimeUsernameProblemLanguageResultExecution timeMemory
161852boolodifjenulaHindeks (COCI17_hindeks)Cpython 3
50 / 50
515 ms56992 KiB
n=int(input())
p=0
L=list(map(int,input().split()))
L1=[0]*1000000
for i in range(n):
    L1[L[i]]+=1
i=-1
while 1:
    i+=1
    if i<=n:
        p=i
    else:
        break
    n-=L1[i]
print(p)
    
#Verdict Execution timeMemoryGrader output
Fetching results...