Submission #870106

#TimeUsernameProblemLanguageResultExecution timeMemory
870106ToighetLPHMExhibition (JOI19_ho_t2)C++17
100 / 100
37 ms4696 KiB
#include <bits/stdc++.h> //#define int long long #define FOR(i,a,b) for (int i=(a);i<=(b);i++) #define FOD(i,a,b) for (int i=(a);i>=(b);i--) #define bit(x,y) ((x)>>(y))&1 #define pb push_back #define ll long long #define ii pair < int,int > #define f first #define s second #define M 1000000007 #define N 100005 using namespace std; int n,m; ii a[N]; int b[N]; signed main() { ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); //freopen(".inp","r",stdin); //freopen(".out","w",stdout); cin>>n>>m; FOR(i,1,n) cin>>a[i].s>>a[i].f; FOR(i,1,m) cin>>b[i]; sort(a+1,a+n+1); sort(b+1,b+m+1); int j=n,res=0; FOD(i,m,1) { while (j && a[j].s>b[i]) --j; if (j) { ++res; --j; } } cout<<res; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...