| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 787349 | andecaandeci | Exhibition (JOI19_ho_t2) | C++17 | 0 ms | 0 KiB |
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 int long long
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, m; cin >> n >> m;
vector<pair<int, int>> a(n);
vector<int> b(m);
for(auto &p : a) cin >> p.second >> p.first;
for(int &p : b) cin >> p;
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
int idx=0;
for(int i=0; i<n && idx<m; i++) {
if(a[i].second>b[idx]) continue;
idx++;
}
cout << idx << '\n';
}