95分代码，哇了14号数据

#include<bits/stdc++.h> 
using namespace std;
int T,n,f[100010];
struct data
{
    int a,b,c;
};
data meal[100010];
bool cmp(data x,data y)
{
    return x.c * y.b < y.c * x.b;
}
int max(int a,int b)
{
    if(a > b)   return a;
    else return b;
}
int main()
{
    scanf("%d%d",&T,&n);
    for(int i = 1;i <= n;i ++)  scanf("%d",&meal[i].a);
    for(int i = 1;i <= n;i ++)  scanf("%d",&meal[i].b);
    for(int i = 1;i <= n;i ++)  scanf("%d",&meal[i].c);
    sort(meal + 1,meal + 1 + n,cmp);
    for(int i = 1;i <= n;i ++)
        for(int j = T;j >= meal[i].c;j --)
            f[j] = max(f[j],f[j - meal[i].c] + meal[i].a - j * meal[i].b);
    int ans = 0;
    for(int i = 1;i <= T;i ++)  
        ans = max(ans,f[i]);
    printf("%d",ans);
}