#include<bits/stdc++.h>
using namespace std;
int dwarfs[10000001];
int elves[1000001];
int mas[1000001];
set<int> opa;
int main(){
int N;
cin>>N;
for(int i=0;i<N;i++){
cin>>mas[i];
}
for(int i=0;i<N;i++){
cin>>dwarfs[i];
}
for(int i=0;i<N;i++){
cin>>elves[i];
opa.insert(elves[i]);
}
int maxa=0;
for(int i=0;i<N;i++){
if(opa.upper_bound(dwarfs[i])!=opa.end()){
maxa++;
opa.erase(opa.upper_bound(dwarfs[i]));
}else{
opa.erase(opa.begin());
}
}
cout<<maxa<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |