| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 232333 | keta_tsimakuridze | Robots (IOI13_robots) | C++14 | 0 ms | 0 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;
long long n,m,q,c[5000005],b[5000000],l,r,mid,ans,d,k,i;
pair<long long,long long>p[5000005];
multiset<long long>s;
int main(){
cin>>n>>m>>q;
for(k=1;k<=n;k++){
cin>>c[k];
}
for(k=1;k<=m;k++){
cin>>b[k];
}
for(k=1;k<=q;k++){
cin>>p[k].first>>p[k].second;
}
sort(c+1,c+n+1);
sort(b+1,b+m+1);
sort(p+1,p+q+1);
l=1; r=q+1; ans=-1; //cout<<b[1]<<" "<<b[2]<<endl;
while(l<=r){
long long mid=(l+r)/2;
i=0;
s.clear();
for(k=1;k<=n;k++){
d=mid;
while(i<q && c[k]>p[i+1].first ){
i++;
s.insert(p[i].second); //if(mid==1) cout<<p[i].second<<"+"<<endl;
}
while(d>0 && s.size()!=0){
d--;
multiset<long long>::iterator it=s.end();
it--;
//if(mid==1) cout<<*it<<"-"<<endl;
s.erase(s.find(*it));
}}
for(i=i+1;i<=q;i++){
s.insert(p[i].second);
} //if(mid==1)cout<<s.size()<<endl;
for(k=1;k<=m;k++){
d=mid;
while(d>0 && s.size()!=0){
d--;
long long st=*s.begin();
if(st>=b[k]) break;
s.erase(s.find(st));
}
}
if(s.size()>0) l=mid+1;
else{
r=mid-1; ans=mid;
}
}
cout<<ans<<endl;
}