제출 #788313

#제출 시각아이디문제언어결과실행 시간메모리
78831312345678Exhibition (JOI19_ho_t2)C++17
100 / 100
45 ms3632 KiB
#include <bits/stdc++.h> using namespace std; int n, m; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n>>m; vector<pair<int, int>> v(n); vector<int> f(m); for (auto &[x, y]:v) cin>>y>>x; for (auto &x:f) cin>>x; sort(v.begin(), v.end()); sort(f.begin(), f.end()); int c=m-1; for (int i=n-1; i>=0&&c>=0; i--) if (v[i].second<=f[c]) c--; cout<<m-1-c; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...