Submission #641025

#TimeUsernameProblemLanguageResultExecution timeMemory
641025kkkkkkkkExhibition (JOI19_ho_t2)C++14
0 / 100
1 ms300 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n,m; cin >> n >> m; vector<pair<int,int> > slika(n); vector<int> ramka(m); for (int i=0;i<n;i++) cin >> slika[i].second >> slika[i].first; for (int i=0;i<m;i++) cin >> ramka[i]; sort(slika.begin(),slika.end()); sort(ramka.begin(),ramka.end()); int index=0,vk=0; for (int i=0;i<n;) { if (index==m) break; if (ramka[index]<slika[i].second) index++; else index++,i++,vk++; } cout << vk << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...