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<array<int,2>>v(n);
vector<int>c(m);
for(int i=0;i<n;i++)cin>>v[i][1]>>v[i][0];
for(int i=0;i<m;i++)cin>>c[i];
sort(c.begin(),c.end());
for(int i=0;i<n;i++){
v[i][1] = m - (lower_bound(c.begin(),c.end(),v[i][1]) - c.begin());
v[i][1]*=-1;
}
sort(v.begin(),v.end());
int ans = 0;
for(int i=n-1;i>=0;i--){
if(ans+1 <= -v[i][1])ans++;
}
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... |