Submission #735840

#TimeUsernameProblemLanguageResultExecution timeMemory
735840JellyTheOctopusExhibition (JOI19_ho_t2)C++17
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> using namespace std; #define f first #define s second int N, M; vector<pair<long long, long long>> P; vector<long long> C; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> N >> M; P.resize(N); C.resize(M); for (int i = 0; i < N; i++) { cin >> P[i].s >> P[i].f; } for (int i = 0; i < M; i++) { cin >> C[i]; } sort(P.begin(), P.end()); sort(C.begin(), C.end()); int i = 0; int j = 0; int ans = 0; while (i < N && j < M) { bool flag = false; while (P[i].s > C[j]) { j++; if (j == M) { flag = true; break; } } if (flag) break; ans++; j++; i++; } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...