#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
int32_t main(){
int n, m, a, b;
cin>>n>>m;
vector<int> frames(m);
priority_queue<pii> pq;
for (int i=0; i<n; ++i)cin>>a>>b, pq.push(mp(b, a));
for (int i=0; i<m; ++i)cin>>frames[i];
sort(frames.begin(), frames.end(), greater<int>());
int ans=0;
for (int i=0; i<m; ++i){
while (!pq.empty()&&(pq.top().second>frames[i]))pq.pop();
if (pq.empty())break;
++ans;
pq.pop();
}
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... |