Submission #125831

#TimeUsernameProblemLanguageResultExecution timeMemory
125831nvmdavaExhibition (JOI19_ho_t2)C++17
100 / 100
71 ms1656 KiB
#include <bits/stdc++.h> using namespace std; vector<int> f; vector<pair<int, int> > v; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin>>n>>m; v.resize(n); f.resize(m); for(int i = 0; i < n; i++) cin>>v[i].second>>v[i].first; for(int i = 0; i < m; i++) cin>>f[i]; sort(f.rbegin(), f.rend()); sort(v.rbegin(), v.rend()); int ans = 0; for(int i = 0; i < n; i++) if(ans < m && f[ans] >= v[i].second) ans++; cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...