Submission #551826

#	Time	Username	Problem	Language	Result	Execution time	Memory
551826		beaconmc	Exhibition (JOI19_ho_t2)	Pypy 3	100 / 100	996 ms	45368 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 = n-1
cur2 = m-1
ans = 0

while 0<=cur and 0<=cur2:
    if frames[cur2] >= pictures[cur][0]:
        ans += 1
        cur2 -= 1
        cur -= 1
    else:
        cur -= 1




print(ans)

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