Submission #2871829

---

Source Code Expand

from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect

def read():
  return int(input())

def reads():
  return [int(x) for x in input().split()]

N = read()
red = []
blue = []

for _ in range(N):
  a, b = reads()
  red.append((a, b))

for _ in range(N):
  c, d = reads()
  blue.append((c, d))

red.sort(); red.reverse()
blue.sort(); blue.reverse()

count = 0
for c, d in blue:
  try:
    p = next((a, b) for a, b in red if a < c and b < d)
    red.remove(p)
    count += 1
  except:
    pass

print(count)

Submission Info

Judge Result