#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define fr first
#define sc second
#define endl '\n'
using namespace std;
int n,m;
int siz[100023],val[100023],fra[100023];
int per[100023];
int main(){
ios_base::sync_with_stdio(23^23);cin.tie(NULL);
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>siz[i]>>val[i];
per[i]=i;
}
for(int i=1;i<=m;i++){
cin>>fra[i];
}
sort(fra+1,fra+m+1);
reverse(fra+1,fra+m+1);
sort(per+1,per+n+1,[&](const int &x,const int &y){
return val[x]>val[y];
});
int ans=0;
for(int i=1;i<=n;i++){
int l=0,r=m;
while(l<r){
int mi=(l+r+1)/2;
if(fra[mi]>=siz[per[i]])l=mi;
else r=mi-1;
}
if(l-1>=ans)ans++;
}
cout<<ans<<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... |