Submission #507342

#TimeUsernameProblemLanguageResultExecution timeMemory
507342CSQ31Exhibition (JOI19_ho_t2)C++17
100 / 100
202 ms4516 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n,m; cin>>n>>m; vector<array<int,2>>v(n); vector<int>c(m); for(int i=0;i<n;i++)cin>>v[i][1]>>v[i][0]; for(int i=0;i<m;i++)cin>>c[i]; sort(c.begin(),c.end()); for(int i=0;i<n;i++){ v[i][1] = m - (lower_bound(c.begin(),c.end(),v[i][1]) - c.begin()); v[i][1]*=-1; } sort(v.begin(),v.end()); int ans = 0; for(int i=n-1;i>=0;i--){ if(ans+1 <= -v[i][1])ans++; } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...