codeforces 158A - Next Round

https://codeforces.com/problemset/problem/158/A

Problem - 158A - Codeforces

 

from bisect import bisect_right, bisect_left
 
 
def sol(nums, n, k):
    nums.sort()
    if nums[-k] != 0:
        answer = (n - bisect_left(nums, nums[-k]))
    else:
        answer = n-nums.count(0)
    return answer
 
 
if __name__ == '__main__':
    n, k = map(int, input().split())
    nums = list(map(int, input().split()))
    print(sol(nums, n, k))
 

이분탐색으로 풀면 쉽게 푸는데 다만 k번째가 0일때는 예외처리해주셔야합니다

It's easy to solve by bisect, but you have to make an exception when the kth is 0.