[백준] 8939번:사냥꾼 (python 파이썬)

문제

www.acmicpc.net/problem/8983

8983번: 사냥꾼

 

소스코드

import sys
input = sys.stdin.readline

m, n, l = map(int, input().split())
man = list(map(int, input().split()))
man.sort()
ani = [list(map(int, input().split())) for i in range(n)]

cnt = 0
for a,b in ani:
    start = 0
    end = len(man)-1
    while start<end:
        mid = (start+end)//2
        if man[mid] < a:
            start = mid+1
        else:
            end = mid
    if abs(man[end]-a)+b<=l or abs(man[end-1]-a)+b<=l:
        cnt += 1

print(cnt)