Submission #1197951

#TimeUsernameProblemLanguageResultExecution timeMemory
1197951JooDdaeWorst Reporter 2 (JOI16_worst_reporter2)C++20
0 / 100
4 ms9792 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int n;
multiset<int> s[200200];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for(int i=1;i<=n;i++) {
        int x, y; cin >> x >> y;
        s[x].insert(y);
    }
    int ans = 0;
    for(int i=1;i<=n;i++) {
        int x, y; cin >> x >> y;

        auto it = s[x].upper_bound(y);
        if(it == s[x].begin()) ans++;
        else s[x].erase(prev(it));
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...