Submission #3246212

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef struct{
    int x;
    int y;
} ax;
int main(){
    int n;
    cin >> n;
    vector<ax> r(n),b(n);
    for(int i = 0; i < n; i++)
        cin >> r[i].x >> r[i].y;
    for(int i = 0; i < n; i++)
        cin >> b[i].x >> b[i].y;
    sort(b.begin(),b.end(),[](auto c,auto d){return c.x < d.x;});
    int count = 0;
    for(int i = 0; i < n; i++){
        int j,max=-1,ab;
        for(j = 0; j < r.size(); j++){
            if(r[j].x < b[i].x && r[j].y < b[i].y){
                if(r[j].y > max){
                    max = r[j].y;
                    ab = j;
                }
            }
        }
        if(max != -1){
            r.erase(ab+r.begin());
            count++;
        }
    }
    cout << count;
}

Submission Info

Judge Result