#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> frames;
vector<pair<ll,ll> > pictures;
vector<ll> fenwick;
ll fsize;
void update(ll x){
//cout<<x<<endl;
while (x<=fsize){
fenwick[x]++;
x+=x&(-x);
}
}
ll get(ll x){
ll ans = 0;
while (x>0){
ans+=fenwick[x];
x-=x&(-x);
}
return ans;
}
int main(){
//freopen("exhibition.in","r",stdin);
ll n,m;
cin>>n>>m;
frames.resize(m);
pictures.resize(n);
for (int i = 0; i<n; i++){
cin>>pictures[i].second>>pictures[i].first;
}
sort(pictures.begin(),pictures.end());
for (int i = 0; i<m; i++){
cin>>frames[i];
}
sort(frames.begin(),frames.end());
fenwick.resize(n+m+2,0);
fsize=n+m+1;
ll ans = 0;
int picindex = 0;
for (int i = n+1; i>=1; i--){
//end position at i+m-1
//find first frame >= pictures[picindex].second
auto it = lower_bound(frames.begin(),frames.end(),pictures[picindex].second);
if (it!=frames.end()){
int offset = it-frames.begin();
update(i+offset+1);
}
ans=max(ans,get(i+m));
picindex++;
}
cout<<ans<<endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
