P2979 [USACO10JAN]奶酪塔Cheese Towers

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cctype>
#include<algorithm>
using namespace std;
#define olinr return
#define _ 0
#define love_nmr 0
#define DB double
inline int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(!isdigit(ch))
    {
        if(ch==‘-‘)
            f=-f;
        ch=getchar();
    }
    while(isdigit(ch))
    {
        x=(x<<1)+(x<<3)+(ch^48);
        ch=getchar();
    }
    return x*f;
}
inline void put(int x)
{
    if(x<0)
    {
        x=-x;
        putchar(‘-‘);
    }
    if(x>9)
        put(x/10);
    putchar(x%10+‘0‘);
}
struct node
{
    int v;
    int w;
}a[205];
int n;
int t;
int k;
int f[1050];
int main()
{
    n=read();
    t=read();
    k=read();
    for(int i=1;i<=n;i++)
    {
        a[i].v=read();
        a[i].w=read();
    }
    for(int i=1;i<=n;i++)
        for(int j=a[i].w;j<=t*5/4;j++)
        {
            f[j]=max(f[j],f[j-a[i].w]+a[i].v);
        }
    int ans=0;
    for(int i=1;i<=n;i++)
        if(a[i].w>=k)
            ans=max(ans,f[(t-a[i].w)*5/4]+a[i].v);
    put(max(ans,f[t]));
    olinr ~~(0^_^0)+love_nmr;
}