Submission #623352

#TimeUsernameProblemLanguageResultExecution timeMemory
623352inksamuraiKralj (COCI16_kralj)C++17
56 / 140
487 ms39336 KiB
#include <bits/stdc++.h> using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define fi first #define se second #define pb push_back #define sz(a) (int)a.size() #define vec(...) vector<__VA_ARGS__> #define _3SgiE60 ios::sync_with_stdio(0),cin.tie(0) typedef long long ll; using pii=pair<int,int>; using vi=vector<int>; void print(){cout<<'\n';} template<class h,class...t> void print(const h&v,const t&...u){cout<<v<<' ',print(u...);} // e signed main(){ _3SgiE60; int n; cin>>n; vi a(n); rep(i,n){ cin>>a[i]; } rep(i,n){ if(a[i]!=1){ assert(0); } } vi b(n); rep(i,n){ cin>>b[i]; } vi c(n); rep(i,n){ cin>>c[i]; } sort(b.begin(), b.end()); multiset<int> mst; rep(i,n){ mst.insert(c[i]); } int res=0; rep(i,n){ auto it=mst.lower_bound(b[i]); if(it!=mst.end()){ mst.erase(it); res+=1; } } print(res); }
#Verdict Execution timeMemoryGrader output
Fetching results...