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>
#define f first
#define s second
using namespace std;
int n , m;
pair<int , int> p[100005];
int fr[100005];
int main (){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for(int i = 0; i < n; ++i) cin >> p[i].s >> p[i].f;
for(int i = 0; i < m; ++i) cin >> fr[i];
int ans = 0;
for(int i = n - 1; i >= 0; --i){
if(fr[m - ans] >= p[i].s) ans++;
if(ans == m) break;
}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... |