# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
623352 | inksamurai | Kralj (COCI16_kralj) | C++17 | 487 ms | 39336 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |