Submission #1207977

#TimeUsernameProblemLanguageResultExecution timeMemory
1207977algoproclubExhibition (JOI19_ho_t2)C++20
100 / 100
40 ms1612 KiB
// UUID: 09f6b0ff-117f-4b3d-b5e4-a699671afc5b #include <iostream> #include <algorithm> #include <vector> using namespace std; int n, m, x; vector <pair <int, int>> v; vector <int> f; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; v.resize(n); f.resize(m); for (auto& p : v) cin >> p.second >> p.first; for (int& i : f) cin >> i; sort(v.begin(), v.end()); sort(f.begin(), f.end()); reverse(v.begin(), v.end()); for (auto p : v) { int l = f.end() - lower_bound(f.begin(), f.end(), p.second); if (l > x) x++; } cout << x; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...