# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
161852 | boolodifjenula | Hindeks (COCI17_hindeks) | Cpython 3 | 515 ms | 56992 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
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 time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |