第八和第十三个点过不了！求助哪位大佬帮忙看看Orz

#include<bits/stdc++.h>
using namespace std;
int n,m,k,i,j,a,b,c,ans,maxx,flag;
int f[10001][1001],top[10001],low[10001],fly[10001],down[10001],num[10001];
int main(){
	scanf("%d%d%d",&n,&m,&k);
	for(i=0;i<n;i++) scanf("%d%d",&fly[i],&down[i]);
	for(i=0;i<=n;i++){
		low[i]=1;
		top[i]=m;
	} 
	memset(num,0,sizeof(num));
	for(i=1;i<=k;i++){
		scanf("%d%d%d",&a,&b,&c);
		low[a]=b+1;
		top[a]=c-1;
		for(j=a;j<n;j++) num[j]++;
	}
	memset(f,127,sizeof(f));
	maxx=f[1][1];
	for(i=1;i<=m;i++) f[0][i]=0;
	for(i=1;i<=n;i++){
		for(j=fly[i-1]+1;j<=fly[i-1]+m;j++)
			f[i][j]=min(f[i-1][j-fly[i-1]],f[i][j-fly[i-1]])+1;
		for(j=m+1;j<=fly[i-1]+m;j++)
			f[i][m]=min(f[i][m],f[i][j]);
		for(j=m-down[i-1];j>=1;j--)
			f[i][j]=min(f[i][j],f[i-1][j+down[i-1]]);
		for(j=1;j<low[i];j++) f[i][j]=maxx;
		for(j=top[i]+1;j<=m;j++) f[i][j]=maxx;
		flag=1;
		for(j=low[i];j<=top[i];j++)
			if(f[i][j]<maxx){
				flag=0; break;
			}
		if(flag){
			cout<<0<<endl<<num[i-1]<<endl;
			return 0;
		}
	}
	ans=maxx;
	for(i=1;i<=m;i++) 					   ans=min(ans,f[n][i]);
	cout<<1<<endl<<ans<<endl;
	return 0;
}