Submission #2865084

---

Source Code Expand

#include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;

int main(){
	int N;
	cin >> N;
	vector<pair<int,int>> a(N), c(N);
	for(int i = 0; i < N; ++i) {
		cin >> a[i].first >> a[i].second;
	}
	for(int i = 0; i < N; ++i){
		cin >> c[i].first >> c[i].second;
	}
	sort(ALL(a));
	sort(ALL(c));
	c.push_back(make_pair(3 * N, 3 * N));
	vector<int> used(N);
	int res = 0;
	for(int i = N -1; i >=0; --i){
		int p = N;
		for(int j = 0; j < N; ++j) {
			if(used[j]) continue;
			if(a[i].first >= c[j].first || a[i].second >= c[j].second)
				continue;
			if(c[j].second < c[p].second) {
				p = j;
			}
		}
		if(p < N) {
			++res;
			used[p] = true;
		}
	}
	cout << res << endl;
	return 0;
}

Submission Info

Judge Result