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 ertek first
#define meret second
using namespace std;
typedef pair<int,int> pii;
const int maxn = 100005;
pii kep[maxn];
int keret[maxn];
int n, m, sol;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n>>m;
for(int i=0;i<n;i++) {
cin>>kep[i].meret>>kep[i].ertek;
}
for(int i=0;i<m;i++) {
cin>>keret[i];
}
sort(keret,keret+m);
sort(kep,kep+n);
int it = n-1;
for(int i=m-1;i>=0;i--) {
while(it >= 0 && keret[i] < kep[it].meret) {
it--;
}
if(it >= 0) {
sol++; it--;
}
}
cout<<sol<<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... |