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;
int main(){
int n, m;
cin >> n >> m;
vector<pair<int, int> > picture(n);
vector<int> frame(m);
for(int i = 0; i < n; i++){
cin >> picture[i].second >> picture[i].first;
}
for(int i = 0; i < m; i++){
cin >> frame[i];
}
sort(picture.begin(), picture.end());
sort(frame.begin(), frame.end());
int ans = 0, i = n - 1;
while(i >= 0 && ans < m){
if(picture[i].second <= frame[m - 1 - ans]){
ans++;
}
i--;
}
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... |