제출 #1302141

#제출 시각아이디문제언어결과실행 시간메모리
1302141HasanV11010238Exhibition (JOI19_ho_t2)C++20
100 / 100
117 ms6804 KiB
#include <bits/stdc++.h> #define ll long long #define mod 1000000007 #define INF 1000000000 using namespace std; int main(){ int n, m, s, v; cin>>n>>m; vector<vector<int>> so; vector<int> ra; for (int i = 1; i <= n; i++){ cin>>s>>v; so.push_back({v, s}); } for (int i = 1; i <= m; i++){ cin>>s; ra.push_back(s); } sort(so.begin(), so.end()); reverse(so.begin(), so.end()); sort(ra.begin(), ra.end()); reverse(ra.begin(), ra.end()); int cur = 0, ans = 0; for (int i = 0; i < n; i++){ if (cur < m && so[i][1] <= ra[cur]){ cur++, ans++; } } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...