제출 #1257133

#제출 시각아이디문제언어결과실행 시간메모리
1257133tritranminh2808Exhibition (JOI19_ho_t2)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; pair <int, int > a[100005]; int b[100005]; int n,m; bool cmp(pair <int, int > x,pair <int, int > y){ return x.second >y.second; } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for(int i=1;i<=n;i++) cin >> a[i].first >> a[i].second; for(int i=1;i<=m;i++) cin >> b[i]; sort(a+1,a+n+1,cmp); sort(b+1,b+m+1); reverse(b+1,b+m+1); int id=1; for(int i=1;i<=n;i++){ if(a[i].first>b[id]) continue; id++; } cout << min(id-1,m); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...