This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const int maxn=2e5+5;
int n,m;
int main(){
cin >> n >> m;
vector<pair<int,int>>a;
for(int i = 0;i < n;i++){
int s,v; cin >> s >> v;
a.push_back({v,s});
}
vector<int>c(m);
for(int i = 0;i < m;i++) cin >> c[i];
sort(c.begin(),c.end());
sort(a.begin(),a.end());
int now = (int)c.size()-1;
for(int i = (int)a.size()-1;i >= 0;i--){
if(now < 0) break;
if(a[i].second <= c[now]) now--;
}
cout<<(int)c.size()-now-1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |