#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<queue>
#define FILE "wing"
typedef long long ll;
typedef double lf;
namespace IO{
	char buf[1<<15],*fs,*ft;
	inline char getc(){return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;}
	inline int read(){
		int x=0,rev=0,ch=getc();
		while(ch<'0'||ch>'9'){if(ch=='-')rev=1;ch=getc();}
		while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getc();}
		return rev?-x:x;
	}
}using namespace IO;
const int MAXN(250000),D(50),INF(1<<30);
int n;
ll a[MAXN+D],b[MAXN+D];
void init(){
	n=read();
	for(int i=1;i<=n;i++)
		a[i]=read();
	for(int i=1;i<=n;i++)
		b[i]=read();
}
std::priority_queue<ll> q;
void work(){
	ll cur=0,cus=0;
	for(int i=1;i<=n;i++){
		q.push(b[i]);
		if((cur+=a[i]-b[i])<0){
			cur+=q.top();
			q.pop();
		}
		else cus++;
	}
	printf("%d\n",cus);
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	init();
	work();
	return 0;
}