Submission #1013613

#TimeUsernameProblemLanguageResultExecution timeMemory
1013613vako_pExhibition (JOI19_ho_t2)C++14
100 / 100
47 ms5812 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back const int mxN = 1e6 + 5; ll n,c[mxN],m; pair<ll,ll> a[mxN]; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for(int i = 0; i < n; i++) cin >> a[i].second >> a[i].first; for(int i = 0; i < m; i++) cin >> c[i]; sort(c, c + m); sort(a, a + n); ll x = m - 1; ll ans = 0; for(int i = n - 1; i >= 0; i--){ if(x < 0) break; if(c[x] >= a[i].second){ x--; ans++; } } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...