/*kZime*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#define MAXN 253333 
#define ll long long


using namespace std;

priority_queue<int> check;
ll ne[MAXN], n, ha, co[MAXN], ans; 
inline ll read() {
	int k = 0, f = 1; char c = getchar();
	for(; !isdigit(c); c = getchar())if(c == '-') f = -1;
	for(; isdigit(c); c = getchar()) k = k * 10 + c - '0';
	return k * f;
}


int main() {
#ifndef LOCAL
	freopen("wing.in", "r", stdin);
	freopen("wing.out", "w", stdout);
#else
	freopen("in.txt", "r", stdin);
#endif
	n = read();
	for(ll i = 1; i <= n; i++)co[i] = read();
	for(ll i = 1; i <= n; i++)ne[i] = read();
	
	for(ll i = 1; i <= n ;i++) {
		ha += co[i];
		ha -= ne[i];
		ans++;
		check.push(ne[i]);
		if(ha < 0) {//没有存货了，考虑更改之前状态 
			if(!check.empty()) {
				ha += check.top();
				ans--;
				check.pop();
			}
		}
	}
	printf("%d",ans);
	return 0;
}