# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
884822 | banhcuon14 | Exhibition (JOI19_ho_t2) | C++14 | 37 ms | 1652 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>
using namespace std;
#define fi first
#define se second
typedef pair<int,int > pii;
typedef long long ll;
const int mod = 1e9 + 7;
const int maxn = 5 + 1e5;
int n, m;
namespace subtask3 {
void solve() {
vector<pair<int,int > > a(n);
vector<int > c(m);
for (int i = 0; i < n; ++i) {
cin >> a[i].first >> a[i].second;
}
for (int i = 0; i < m; ++i) {
cin >> c[i];
}
sort(c.begin(),c.end());
sort(a.begin(),a.end(),[] (const pii& a, const pii& b) {
if (a.second != b.second) return a.second < b.second;
return a.first < b.first;
});
int res = 0;
for (int i = n-1; i >= 0 && res < m; --i) {
if (c[m - res - 1] >= a[i].first) ++res;
}
cout << res;
}
}
signed main()
{
#define name "task"
if (fopen(name".inp", "r")) {
freopen(name".inp", "r", stdin);
freopen(name".out", "w", stdout);
}
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
subtask3::solve();
cerr << "Time Elasped: " << fixed << setprecision(3) << 1.0*clock()/CLOCKS_PER_SEC << '\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... |