# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
129367 | Latina | Exhibition (JOI19_ho_t2) | C++14 | 67 ms | 1908 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;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M; cin >> N >> M;
vector<pair<int, int> > pics;
for (int i = 0; i < N; i++) {
int S, V; cin >> S >> V;
pics.push_back({V,S});
}
sort(pics.begin(), pics.end());
vector<int> C(M);
for (int i = 0; i < M; i++) cin >> C[i];
sort(C.begin(), C.end());
int ans = 0;
for (int i = N-1; i >= 0 && ans < M; i--) if (C[M-ans-1] >= pics[i].second) ans++;
cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |