| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1351123 | guardianec | Exhibition (JOI19_ho_t2) | C++20 | 28 ms | 2628 KiB |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n,m;
cin >> n >> m;
vector<pair<ll,ll>> a(n);
vector<ll> b(m);
for (int i=0; i<n; i++) {
cin >> a[i].second >> a[i].first;
}
for (int i=0; i<m; i++) {
cin >> b[i];
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
ll res = 0;
ll j = n-1;
for (int i=m-1; i>=0 && j>=0; i--) {
while (j>=0 && a[j].second>b[i]) j--;
if (j>=0) {
res++; j--;
}
}
cout << res;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
