Submission #1451955

---

Source Code Expand

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

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()

const ll mod = 1e9 + 7;
const ll INF = 1<<30;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;

int n, m;
pair<int, int> xy[100000 + 5];
int a[100000 + 5];

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> m;
    rep(i, n) {
        cin >> xy[i].fi;
        cin >> xy[i].se;
    }
    rep(i, m) cin >> a[i];
    sort(xy, xy + n);
    sort(a, a + m);
    int now = 0;
    priority_queue<int, vector<int>, greater<int>> pq;
    int ans = 0;
    rep(i, m) {
        while (now < n && xy[now].fi <= a[i]) {
            pq.push(xy[now].se);
            now++;
        }
        while (!pq.empty()) {
            int y = pq.top(); pq.pop();
            if (a[i] <= y) {
                ans++;
                break;
            }
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result