제출 #306103

#제출 시각아이디문제언어결과실행 시간메모리
306103vipghn2003Exhibition (JOI19_ho_t2)C++14
100 / 100
64 ms3448 KiB
#include<bits/stdc++.h> #define fi first #define se second #define pii pair<int,int> #define mp make_pair using namespace std; const int N=1e5+5; int n,m,c[N]; pii a[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin>>n>>m; vector<int>val; for(int i=1;i<=n;i++) cin>>a[i].se>>a[i].fi; for(int i=1;i<=m;i++) cin>>c[i]; sort(a+1,a+n+1); sort(c+1,c+m+1); int cur=n,res=0; for(int i=m;i>=1;i--) { while(cur>=1&&a[cur].se>c[i]) cur--; if(cur) { res++; cur--; } } cout<<res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...