제출 #1191821

#제출 시각아이디문제언어결과실행 시간메모리
1191821PakinDioxideExhibition (JOI19_ho_t2)C++17
100 / 100
31 ms3400 KiB
/* author : PakinDioxide created : 25/04/2025 20:25 task : JOI19_ho_t2 */ #include <bits/stdc++.h> #define ll long long using namespace std; int main() { ios::sync_with_stdio(0), cin.tie(0); int n, m; cin >> n >> m; pair <ll, ll> A[n]; ll a[n], b[m]; for (auto &[x, y] : A) cin >> y >> x; for (auto &e : b) cin >> e; sort(b, b+m); sort(A, A+n); for (int i = 0; i < n; i++) a[n-i-1] = A[i].second; int ans = 0, idx = m-1; ll mn = LLONG_MAX; for (auto &e : a) { mn = min(mn, e); if (mn <= b[idx]) idx--, mn = LLONG_MAX, ans++; if (idx < 0) break; } cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...