Submission #391341

#TimeUsernameProblemLanguageResultExecution timeMemory
391341timmyfengExhibition (JOI19_ho_t2)C++17
100 / 100
99 ms1596 KiB
#include <bits/stdc++.h> using namespace std; const int N = 100000; array<int, 2> pics[N]; int frames[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; for (int i = 0; i < n; ++i) { auto &[v, s] = pics[i]; cin >> s >> v; } sort(pics, pics + n); for (int i = 0; i < m; ++i) { cin >> frames[i]; } sort(frames, frames + m); int low = 0, high = m; while (low < high) { int mid = (low + high + 1) / 2; int j = 0; for (int i = 0; i < n && j < mid; ++i) { auto [v, s] = pics[i]; j += s <= frames[m - mid + j]; } if (j == mid) { low = mid; } else { high = mid - 1; } } cout << high << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...