#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
const int MAX = 5e5 + 5;
struct Data{
int x, l;
bool operator < (const Data& oth) const{
return x + l < oth.x + oth.l;
}
} a[MAX];
int nArr;
void Whisper(){
cin >> nArr;
FOR(i, 1, nArr) cin >> a[i].x;
FOR(i, 1, nArr) cin >> a[i].l;
sort(a + 1, a + nArr + 1);
priority_queue<int> q;
int sum = 0, ans = 0;
for (int i = 1; i <= nArr; ++i){
if (sum > a[i].l){
if(q.top() > a[i].x){
sum -= q.top(); q.pop();
sum += a[i].x; q.push(a[i].x);
}
}
else{
sum += a[i].x;
q.push(a[i].x);
}
maximize(ans, (int)q.size());
}
cout << ans;
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
