rqnoj-57-找啊找啊找GF

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
const int maxtime = 200000;
int n,rp[110],t[110],rmb[110],m,r,f[110][110],ct[110][110];

void init()
{
     freopen("gf.in","r",stdin);
     freopen("gf.out","w",stdout);
}

void readdata()
{
     scanf("%d",&n);
     for(int i=1;i<=n;i++)
     {
             scanf("%d%d%d",&rmb[i],&rp[i],&t[i]);
             t[i] = maxtime - t[i];
             }
     scanf("%d%d",&m,&r);
} 

void work()
{                       
     for(int i=1;i<=n;i++)
     {                          
        for(int j=m;j>=rmb[i];j--)
           {
               for(int k=r;k>=rp[i];k--)
                 {                       
                      f[j][k]=max(f[j][k],f[j-rmb[i]][k-rp[i]]+t[i]);
                 }
           }
     }
     
     printf("%d",maxtime - f[m][r] % maxtime);
}
     
int main()
{
    //init();
    readdata();
    work();
    return 0;
}