Submission #1159930

#TimeUsernameProblemLanguageResultExecution timeMemory
1159930fatman87878Exhibition (JOI19_ho_t2)C++20
100 / 100
33 ms1608 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define all(x) (x).begin(),(x).end() #define lb(x) ((x)&-(x)) #define IOS cin.tie(nullptr)->sync_with_stdio(0); constexpr int maxN = 1e5+5; int n,m,h[maxN]; pair<int,int> val[maxN]; int main(){ IOS cin>>n>>m; for(int i = 0;i<n;i++)cin>>val[i].second>>val[i].first; for(int i = 0;i<m;i++)cin>>h[i]; sort(val,val+n); sort(h,h+m); int ans = 0; for(int i = m,ptr = n-1;i--;ptr--){ for(;ptr>=0&&val[ptr].second>h[i];ptr--); if(ptr==-1)break; ans++; } cout<<ans<<'\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...