#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;
void solve(){
ll n, i, j, sum=0;
cin>>n;
vector<pair<ll, pair<ll, ll>>> a(n);
vector<ll> dp(n+1, inf);
dp[0] = 0;
for(i=0;i<n;++i){
cin>>a[i].second.second;
}
for(i=0;i<n;++i){
cin>>a[i].second.first;
a[i].first = a[i].second.first + a[i].second.second;
}
sort(a);
multiset<ll> s;
for(i=0;i<n;++i){
if(a[i].second.first >= sum){
sum += a[i].second.second;
s.insert(a[i].second.second);
}else{
if(*s.rbegin() > a[i].second.second){
sum -= *s.rbegin();
s.erase(s.find(*s.rbegin()));
s.insert(a[i].second.second);
sum += a[i].second.second;
}
}
}
cout<<s.size()<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
srand(time(nullptr));
ll t=1;
// cin>>t;
for(;t>0;--t){
solve();
}
return 0;
}
