Submission #521289

#TimeUsernameProblemLanguageResultExecution timeMemory
521289emon_2007Exhibition (JOI19_ho_t2)C++17
100 / 100
149 ms5540 KiB
#include<bits/stdc++.h> using namespace std; #define int long long const int MAX_N = 1000010; int32_t main() { int n, m, ans = 0; cin >> n >> m; pair<int, int> a[n + 1]; for(int i = 1; i <= n; i++) { cin >> a[i].first >> a[i].second; swap(a[i].first, a[i].second); } int b[m + 1]; for(int i = 1; i <= m; i++) { cin >> b[i]; } sort(a + 1, a + n + 1); sort(b + 1, b + m + 1); reverse(a + 1, a + n + 1); reverse(b + 1, b + m + 1); int j = 1; for(int i = 1; i <= m; i++) { while(j <= n and a[j].second > b[i]) { j++; } ans += (j <= n ? 1 : 0); j++; } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...