# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1263398 | tminh | Exhibition (JOI19_ho_t2) | C++20 | 0 ms | 328 KiB |
#include "bits/stdc++.h"
using namespace std;
#define task ""
#define ll long long
#define endl '\n'
#define fi first
#define se second
#define vall(a) (a).begin(), (a).end()
#define sze(a) (int)a.size()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ep emplace_back
#define pb push_back
#define pf push_front
const ll mod = 1e9 + 7;
const int N = 1e6 + 5;
const ll oo = 1e18;
bool START;
int n, m, ans = 0;
ll b[N];
pll a[N];
multiset<ll> s;
inline void solve() {
sort(a + 1, a + 1 + n);
sort(b + 1, b + 1 + m);
int j = 1;
ll last = -oo;
for (int i = 1; i <= m; ++i) {
while(j <= n && a[j].fi <= b[i]) {
s.insert(a[j].se);
++j;
}
auto nxt = s.lower_bound(last);
if (nxt != s.end()) {
last = *nxt;
s.erase(nxt);
++ans;
}
}
cout << ans;
}
inline void input() {
cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> a[i].fi >> a[i].se;
for (int i = 1; i <= m; ++i) cin >> b[i];
return solve();
}
bool END;
int main() {
if(fopen(task ".inp", "r")) {
freopen(task ".inp", "r", stdin);
freopen(task ".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
input();
cerr << endl << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << 's' << endl;
cerr << "Memory: " << fabs ((&END - &START)) / 1048576.0 << "MB\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |