蓝桥杯刷题--python-18

3745. 牛的学术圈 I - AcWing题库

n,L=map(int,input().split())
c=list(map(int,input().split()))
c=[0]+c
def check(mid):
    a=0
    b=0
    for i in range(1,n+1):
        if c[i]>=mid:a+=1
        elif c[i]==mid-1:b+=1
    return a+min(b,L)>=mid

l=0
r=n
while(l<r):
    mid=l+r+1>>1
    if check(mid):
        l=mid
    else:
        r=mid-1

print(r)

 4655. 重新排序 - AcWing题库

n = int(input())
a = [0] + list(map(int, input().split()))
a_s = [0 for i in range(n + 1)]
for i