Submission #129387

#TimeUsernameProblemLanguageResultExecution timeMemory
129387nhimnam120Exhibition (JOI19_ho_t2)C++14
100 / 100
294 ms3880 KiB
#include<bits/stdc++.h> #define fi first #define se second using namespace std; vector<pair<long long, long long> > pic; vector<long long> frame; signed main(){ long long n,m; cin >> n >> m; for(int i=1;i<=n;i++){ long long s,v; cin >> s >> v; pic.push_back({v,s}); } for(int i=1;i<=m;i++){ long long a; cin >> a; frame.push_back(a); } sort(pic.begin(),pic.end()); sort(frame.begin(),frame.end()); long long ans=m-1; for(int i=n-1;i>=0;i--){ if(pic[i].se<=frame[ans]){ //cout << pic[i].se << " " << frame[ans]<<endl; ans--; } if(ans<0){ break; } } cout << (m-ans-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...