Submission #129385

#TimeUsernameProblemLanguageResultExecution timeMemory
129385ntrung03Exhibition (JOI19_ho_t2)C++17
100 / 100
250 ms1672 KiB
#include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { int n,m; cin>>n>>m; vector<pair<int,int>> p(n); for(auto&p:p) cin>>p.second>>p.first; sort(p.begin(),p.end()); vector<int> fr(m); for(auto&fr:fr) cin>>fr; sort(fr.begin(),fr.end()); auto frp = fr.rbegin(); int res =0; for(auto it=p.rbegin();it!=p.rend()&&frp!=fr.rend();it++){ if(*frp>=it->second){ res++; frp++; } } cout<<res<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...