Submission #2407494

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

///////////////////////////////////////////
const long long int INF = 1000000000000000000LL;
using ll = long long int;
using vi = vector<int>;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rep(i,N) for(int i=0;i<N;i++)
//template <class  T>T max(T x,T y){if(x>y){return x;}else{return y;}}
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return 1; } return 0; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return 1; } return 0; }
///////////////////////////////////////////

int main(){
    ll n ;
    cin>>n;
    vector<pair<int,int>> r,b;
    int x,y;
    rep(i,n){
        cin>>x>>y;
        r.push_back(make_pair(x,y));
    }
    rep(i,n){
        cin>>x>>y;
        b.push_back(make_pair(x,y));
    }
    sort(all(r));
    sort(all(b));
    ll ans=0;
    while (1){
        if(r[0].first<b[0].first && r[0].second<b[0].second){
            ans++;
            r.erase(r.begin());
            b.erase(b.begin());
        }else{
            break;
        }
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result