Submission #572057

#TimeUsernameProblemLanguageResultExecution timeMemory
5720571neExhibition (JOI19_ho_t2)C++14
0 / 100
47 ms340 KiB
#include<bits/stdc++.h> using namespace std; const long long mxn = 1e12; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); long long n,m;cin>>n>>m; vector<pair<long long ,long long>>arr(n); for (int i = 0;i<n;++i){ cin>>arr[i].first>>arr[i].second; } vector<long long >brr(m); for (int i = 0;i<m;++i)cin>>brr[i]; sort(brr.begin(),brr.end()); sort(arr.begin(),arr.end(),[&](auto x,auto y){ return x.second < y.second; }); function<long long(int,int)> solve = [&](int cur,int pos){ if (cur==n)return 0LL; long long ans = solve(cur + 1,pos); if (pos + 1 < m) ans = max(ans,solve(cur,pos + 1)); if (pos < m && brr[pos]>=arr[cur].first){ ans = max(ans,solve(cur + 1,pos + 1) + 1); } return ans; }; long long ans = solve(0,0); cout<<ans<<'\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...