Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define L first
- #define R second
- #define pii pair<int, int>
- using namespace std;
- int main() {
- int n, m;
- cin >> n >> m;
- multiset<int> shirts;
- for (int i = 0; i < n; ++i) {
- int x;
- cin >> x;
- shirts.insert(x);
- }
- vector<pii> ranges(m);
- for (int i = 0; i < m; ++i) {
- cin >> ranges[i].L >> ranges[i].R;
- }
- sort(ranges.begin(), ranges.end(), [](auto a, auto b) {
- return (a.R < b.R);
- });
- int ans = 0;
- for (auto [l, r] : ranges) {
- auto it = shirts.lower_bound(l);
- if (it != shirts.end() && (*it) <= r) {
- ans++;
- shirts.erase(it);
- }
- }
- cout << ans;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement