Submission #1027104

#TimeUsernameProblemLanguageResultExecution timeMemory
1027104giorgi_pkhaladzeExhibition (JOI19_ho_t2)C++14
50 / 100
100 ms2784 KiB
#include <bits/stdc++.h> #define int long long #define pii pair<int,int> #define pll pair<ll,ll> #define pb push_back #define ff first #define ss second using namespace std; const int N=2*1e5; int n,m,k,i,j,ans; signed main() { cin>>n>>m; vector<int> a(m); vector<pii> p(n); for(int k=0; k<n; k++) cin>>p[k].ss>>p[k].ff; for(int k=0; k<m; k++)cin>>a[k]; sort(a.rbegin(),a.rend()); sort(p.rbegin(),p.rend()); int pos=0; for(int k=0; k<n; k++){ if(p[k].ss<=a[pos])pos++; } cout<<pos; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...