NICA #3 抗洪救灾 65分求调！

#include<bits/stdc++.h>
#define int long long
#define debug(x) cout<<#x<<"="<<x<<endl;

using namespace std;
inline int read()
{
	int suffm=0,sym=1;
	char chr=getchar();
	while(chr<'0'||chr>'9'){if(chr=='-') sym=-1;chr=getchar();}
	while(chr>='0'&&chr<='9'){suffm=(suffm<<3)+(suffm<<1)+(chr^48);chr=getchar();}
	return suffm*sym;
}
inline void write(int suffm)
{
	if(suffm<0){putchar('-');suffm=-suffm;}	
	if(suffm>9) write(suffm/10);
	putchar(suffm%10+48);
}
const int MAXN=5010;
int n,k,m;
int cur=0;
int curk=0;  //连续k小时超过阈值
int ai[MAXN],bi[MAXN];
int a[MAXN],pre[MAXN];   //前缀和
signed main()
{
	n=read(),k=read(),m=read();
	for(int i=1;i<=n;i++) ai[i]=read();
	for(int i=1;i<=n;i++) bi[i]=read();
	for(int i=1;i<=n;i++)
	{
		a[i]=ai[i]-bi[i];
		pre[i]=pre[i-1]+a[i];
	}
	for(int l=1;l<=n;l++)
	{
		for(int r=l+k-1;r<=n;r++)
		{
			if(pre[r]-pre[l-1]>=m)
			{
//				cout<<pre[r]<<" "<<pre[l]<<endl;
				puts("Yes");
				return 0;
			}
		}
	}
	puts("No");
	return 0;
}