제출 #256361

#제출 시각아이디문제언어결과실행 시간메모리
256361Osama_AlkhodairyExhibition (JOI19_ho_t2)C++17
100 / 100
92 ms4600 KiB
#include <bits/stdc++.h> using namespace std; #define finish(x) return cout << x << endl, 0 #define ll long long int n, m; vector <pair <int, int> > a; vector <int> b; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; a.resize(n); for(auto &i : a) cin >> i.second >> i.first; b.resize(m); for(auto &i : b) cin >> i; sort(a.begin(), a.end()); sort(b.begin(), b.end()); int ans = 0; int l = n - 1, r = m - 1; while(l >= 0 && r >= 0){ if(b[r] >= a[l].second){ ans++; l--; r--; } else l--; } cout << ans << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...