제출 #520775

#제출 시각아이디문제언어결과실행 시간메모리
520775cig32Exhibition (JOI19_ho_t2)C++17
100 / 100
148 ms5668 KiB
#include "bits/stdc++.h" #define int long long using namespace std; const int MAXN = 1e6 + 10; int32_t main() { int n, m, j = 1, 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); for(int i=1; i<=m; i++) { while(j <= n && a[j].second > b[i]) j++; ans += (j <= n ? 1 : 0); j++; } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...