#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <stdlib.h>
#define ll long long
using namespace std;
ll a,b,c,d,e,f,m,i,j,n,h,g,l,r,ka,p,q,t[100005];
map<ll,ll> maa,mii,mee;
vector<ll> vj,vo,vi;
string x,y,z;
pair<ll,ll> k[100005];
int main(){
cin>>a>>b;
for(i=0 ; i<a ; i++){
cin>>k[i].second>>k[i].first;
}
sort(k,k+a);
for(i=0 ; i<b ; i++){
cin>>t[i];
}
sort(t,t+b);
h=a-1;
g=0;
for(i=b-1 ; i>=0 ; i--){
for(j=h ; j>=0 ; j--){
if(k[j].second<=t[i]){
g++;
h=j-1;
break;
}
if(j==0){
h=-1;
}
}
}
cout<<g<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |