#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define vodka void
#define ertunt return
using namespace std;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
ll n,m;
cin >> n >> m;
vector<pair<ll,ll>>a(n);
for(ll i = 0; i < n; i++)cin >> a[i].ss >> a[i].ff;
vector<ll>c(m);
for(ll i = 0; i < n; i++)cin >> c[i];
sort(all(a));
sort(all(c));
ll ans = 0, cur = m-1;
for(ll i = n-1; i >= 0; i--){
if(cur>=1&&c[cur]>=a[i].ss){
ans++;
cur--;
}
}
cout << ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |