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;
#define int long long int
bool comp(pair<int,int>&a, pair<int,int>&b) {
return a.second<b.second;
}
int32_t main() {
int n,m; cin >> n >> m;
vector<pair<int,int>> paintings(n);
vector<int> frames(m);
for (int i=0;i<n;i++) {
cin >> paintings[i].first >> paintings[i].second;
}
for (int i=0;i<m;i++) {
cin >> frames[i];
}
sort(frames.begin(),frames.end());
sort(paintings.begin(),paintings.end(),comp);
int sus;
vector<int> bruh;
for (int i=0;i<n;i++) {
sus=lower_bound(frames.begin(),frames.end(),paintings[i].first)-frames.begin();
bruh.push_back(sus);
}
int ans=0;
for (int i=n-1;i>-1;i--) {
if (bruh[i]<m) {
ans++; m--;
}
}
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... |