제출 #1264784

#제출 시각아이디문제언어결과실행 시간메모리
1264784lemoncatExhibition (JOI19_ho_t2)C++20
100 / 100
85 ms3768 KiB
#include<bits/stdc++.h> using namespace std; #define int long long int n, m, ans, x, y; vector<int> c; vector<pair<int, int>> v; signed main() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> x >> y; v.push_back({y, x}); } for (int i = 1; i <= m; i++) { cin >> x; c.push_back(x); } sort(v.begin(), v.end()); sort(c.begin(), c.end()); for (int i = n - 1; i >= 0; i--) { if (ans == m) break; if (c[m - ans - 1] >= v[i].second) ans++; } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...