Submission #1015617

#TimeUsernameProblemLanguageResultExecution timeMemory
1015617adkjtExhibition (JOI19_ho_t2)C++14
100 / 100
87 ms5968 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define ll long long pair<int,int> a[111111]; int b[111111]; //int fra[111111]; signed main() { int n,m;cin>>n>>m; for(int i = 1; i <= n; i++) cin >> a[i].second >> a[i].first; for(int i = 1; i <= m; i++) cin >> b[i]; sort(b+1, b+1 + m); sort(a+1, a+1 + n); ll x = m; ll ans = 0; for(int i = n; i > 0&&x; i--){ if(b[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...