제출 #1317846

#제출 시각아이디문제언어결과실행 시간메모리
1317846kawhietExhibition (JOI19_ho_t2)C++20
100 / 100
37 ms1856 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; vector<int> s(n), v(n), c(m); for (int i = 0; i < n; i++) { cin >> s[i] >> v[i]; } for (int i = 0; i < m; i++) { cin >> c[i]; } ranges::sort(c); vector<int> ord(n); iota(ord.begin(), ord.end(), 0); ranges::sort(ord, [&](int i, int j) { if (v[i] == v[j]) return s[i] < s[j]; return v[i] < v[j]; }); ranges::reverse(ord); int j = m - 1, ans = 0; for (auto i : ord) { if (s[i] <= c[j]) { j--; ans++; } if (j < 0) break; } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...