This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//challenge: 100
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define x first
#define y second
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,m;cin>>n>>m;
vector<pair<int,int>> v(n);
for(int i=0;i<n;i++){
cin>>v[i].y>>v[i].x;
}
vector<int> a(m);
for(int i=0;i<m;i++){
cin>>a[i];
}
sort(all(v));
sort(all(a));
int ans=0;
for(int i=n-1;i>=0;i--){
if(ans<=m-1&&a[m-1-ans]>=v[i].y){
ans++;
}
}
cout<<ans<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |