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;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n,m;
cin >> n >> m;
pair<long long,long long> arr[n];
for(int i=0; i<n; i++) cin >> arr[i].second >> arr[i].first;
sort(arr,arr+n);
long long brr[m];
for(int i=0; i<m; i++) cin >> brr[i];
sort(brr,brr+m);
int ans=0,cnt=m-1;
for(int i=n-1; i>=0; i--){
if(cnt<0) break;
if(arr[i].second<=brr[cnt]){
ans++;
cnt--;
}
}
cout << ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |