#include <bits/stdc++.h>
#define ll long long
#define MAXN 500010
using namespace std;
ll l[MAXN],x[MAXN];
vector<pair<ll,ll> > v;
int main()
{
ios::sync_with_stdio(false); cin.tie(); cout.tie();
ll n;
cin >> n;
for (ll i=1;i<=n;i++)
cin >> x[i];
for (ll i=1;i<=n;i++)
{
cin >> l[i];
v.push_back({x[i]+l[i],i});
}
sort(v.begin(),v.end());
priority_queue<ll> q;
ll cur=0;
for (auto p : v)
{
ll i=p.second;
if (l[i]>=cur)
{
cur+=x[i];
q.push(x[i]);
}
else if (q.top()>x[i])
{
cur-=q.top();
q.pop();
cur+=x[i];
q.push(x[i]);
}
}
cout << q.size();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |