Submission #1180772

#TimeUsernameProblemLanguageResultExecution timeMemory
1180772miniobExhibition (JOI19_ho_t2)C++20
100 / 100
80 ms2060 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, m, odp = 0; cin >> n >> m; vector<pair<int, int>> obrazy; vector<int> ramy; for(int i = 0; i < n; i++) { int x, y; cin >> x >> y; obrazy.push_back({y, x}); } for(int i = 0; i < m; i++) { int x; cin >> x; ramy.push_back(x); } sort(ramy.begin(), ramy.end()); sort(obrazy.begin(), obrazy.end()); int gdzie = n - 1; for(int i = m - 1; i >= 0; i--) { while(gdzie >= 0 && obrazy[gdzie].second > ramy[i]) { gdzie--; } if(gdzie > -1) { gdzie--; odp++; } } cout << odp << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...