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;
typedef long long ll;
int main() {
int n,m; cin>>n>>m;
vector<pair<int,int>> a;
for (int i=0; i<n; i++) {
int s,v; cin>>s>>v;
a.push_back({v,s});
}
vector<int> c(m);
for (auto &i: c) cin>>i;
sort(a.rbegin(),a.rend());
sort(c.rbegin(),c.rend());
int i=0;
int j=0;
int ans=0;
while (i<m&&j<n) {
if (a[j].second<=c[i]) {
ans++;
j++;
i++;
} else {
j++;
}
}
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... |