제출 #1161106

#제출 시각아이디문제언어결과실행 시간메모리
1161106Kalata_56Kralj (COCI16_kralj)C++20
0 / 140
731 ms26640 KiB
#include<bits/stdc++.h> using namespace std; int dwarfs[1000001]; int elves[100001]; int mas[100001]; multiset<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.lower_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 timeMemoryGrader output
Fetching results...