本课程尚无中文翻译,以下显示英文原文。
Implementation
Time Complexity:
from bisect import bisect_left, bisect_rightwith open("haybales.in") as read:bale_num, query_num = [int(i) for i in read.readline().split()]haybales = sorted(int(i) for i in read.readline().split())ans = []for _ in range(query_num):start, end = [int(i) for i in read.readline().split()]left = bisect_left(haybales, start)right = bisect_right(haybales, end)ans.append(right - left)print("\n".join(str(a) for a in ans), file=open("haybales.out", "w"))