Submission #1129260

#TimeUsernameProblemLanguageResultExecution timeMemory
1129260tsengangExhibition (JOI19_ho_t2)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> #define ll long long #define ff first #define ss second #define pb push_back #define all(x) x.begin(), x.end() #define vodka void #define ertunt return using namespace std; int main() { ios::sync_with_stdio(0); cin.tie(0); ll n,m; cin >> n >> m; vector<pair<ll,ll>>a(n); for(ll i = 0; i < n; i++)cin >> a[i].ss >> a[i].ff; vector<ll>c(m); for(ll i = 0; i < n; i++)cin >> c[i]; sort(all(a)); sort(all(c)); ll ans = 0, cur = m-1; for(ll i = n-1; i >= 0; i--){ if(cur>=1&&c[cur]>=a[i].ss){ ans++; cur--; } } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...