Submission #2412465


Source Code Expand

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

int n,x,y,ans;
int cnt[10020];

vector<pair<pair<int, int>, int> > a;
int main(){
    cin>>n;

    for(int i=0;i<n;i++){
        cin>>x>>y;
        a.push_back(make_pair(make_pair(x,y),0));
    }
    for(int i=0;i<n;i++){
        cin>>x>>y;
        a.push_back(make_pair(make_pair(x,y),1));
    }
    sort(a.begin(),a.end());
    for(int i=0;i<a.size();i++){
        if(!a[i].second)
            cnt[a[i].first.second]++;
        else{
            for(int j=a[i].first.second-1;j>=0;j--){
                if(cnt[j]){
                    cnt[j]--;
                    ans++;
                    break;
                }
            }
        }    
    }
    cout<<ans<<"\n";
    return 0;
}

Submission Info

Submission Time
Task C - 2D Plane 2N Points
User charter
Language C++14 (GCC 5.4.1)
Score 400
Code Size 772 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 5
AC × 17
Set Name Test Cases
Sample example_0, example_1, example_2, example_3, example_4
All example_0, example_1, example_2, example_3, example_4, line_0, line_1, line_2, line_3, maxrand_0, maxrand_1, maxrand_2, maxrand_3, maxrand_4, rand_0, rand_1, rand_2
Case Name Status Exec Time Memory
example_0 AC 1 ms 256 KB
example_1 AC 1 ms 256 KB
example_2 AC 1 ms 256 KB
example_3 AC 1 ms 256 KB
example_4 AC 1 ms 256 KB
line_0 AC 1 ms 256 KB
line_1 AC 1 ms 256 KB
line_2 AC 1 ms 256 KB
line_3 AC 1 ms 256 KB
maxrand_0 AC 1 ms 256 KB
maxrand_1 AC 1 ms 256 KB
maxrand_2 AC 1 ms 256 KB
maxrand_3 AC 1 ms 256 KB
maxrand_4 AC 1 ms 256 KB
rand_0 AC 1 ms 256 KB
rand_1 AC 1 ms 256 KB
rand_2 AC 1 ms 256 KB