Submission #548550

#	Time	Username	Problem	Language	Result	Execution time	Memory
548550		beaconmc	Exhibition (JOI19_ho_t2)	Pypy 3	0 / 100	48 ms	18324 KiB

joi2019_ho_t2

from heapq import *
n,m = map(int, input().split())
pictures = []
frames = []
for i in range(n):
    pictures.append(list(map(int, input().split())))

for i in range(m):
    frames.append(int(input()))

pictures.sort(key=lambda x:(x[1], x[0]))
frames.sort()

cur = 0
ans = 0
for i in range(m):
    if cur!= n and pictures[cur][0] > frames[i]:
        cur+= 1
        continue
    ans += 1
    cur += 1
    

print(ans)

• Subtask 1: 0 / 10
• Subtask 2: 0 / 40
• Subtask 3: 0 / 50