样例都不过 纯纯错误程序居然骗了55分 调的动力都没了

#include<bits/stdc++.h>
using namespace std;
struct node{
	int t,h,l;
}lj[105];
int n,m;
int ti[101];
int f[105][105];
bool cmp(node a,node b)
{
	return a.t < b.t;
}
int main()
{
	scanf("%d%d",&m,&n);
	for(int i = 1;i <= n;++ i)
		scanf("%d%d%d",&lj[i].t,&lj[i].l,&lj[i].h);
	sort(lj + 1,lj + n + 1,cmp);
	f[0][0] = 10;
	for(int i = 1;i <= n;++ i)
	{
		for(int j = 0;j <= m;++ j)
		{
			if(f[i - 1][j] >= lj[i].t)
			{
				if(j + lj[i].h > m){
					printf("%d",lj[i].t);
					return 0;
				}
				f[i][j + lj[i].h] = max(f[i - 1][j],f[i][j + lj[i].h]);
				f[i][j] = max(f[i - 1][j] + lj[i].l,f[i][j]);
			}
		}
	}
//	for(int i = 1;i <= n;++ i)
//		cout << f[i][0] << endl;
	printf("%d",f[n][0]);
	return 0;
}