洛谷 P2979 [USACO10JAN]奶酪塔Cheese Towers

洛谷 P2979 [USACO10JAN]奶酪塔Cheese Towers
分两种状态 一种最上面有大奶酪
一种没有

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
#include <iomanip>
#define For(i,j,k) for(int i=j;i<=k;i++)
#define Dow(i,j,k) for(int i=j;i>=k;i--)
#define LL long long
using namespace std ;
inline int read() {
    int x = 0 , f = 1 ;
    char ch = getchar() ;
    while(ch<'0'||ch>'9') { if(ch=='-') f = -1 ; ch = getchar() ; }
    while(ch>='0'&&ch<='9') { x = x * 10+ch-48 ; ch = getchar() ; }
    return x * f ;
}

const int N = 1011, inf = 1e9;
int n,H,K,ans,tot;
int f[N][2];
struct node{
    int h,v;
}a[111];
inline bool cmp_1(node a, node b) { return a.h > b.h; } 
inline bool cmp_2(node a, node b) { return a.h < b.h; } 

int main() {
    n=read(); H=read(); K=read();
    For(i, 1, n) a[i].v=read(), a[i].h = read();
    For(i, 1, H) f[i][1]=-1;
    sort(a+1, a+n+1, cmp_1); 
    for(; a[tot+1].h >= K; tot++) 
    sort(a+1, a+tot+1, cmp_2);  
    
    For(i, 1, n) 
      For(j, a[i].h, H) {
        f[j][0] = max(f[j][0], f[j-a[i].h][0]+a[i].v);
        if(f[j-a[i].h/5*4][1]!=-1) f[j][1] = max(f[j][1], f[j-a[i].h/5*4][1]+a[i].v);
        if(a[i].h>=K) f[j][1] = max(f[j][1], f[(j-a[i].h)/5*4][0]+a[i].v );
    }
    printf("%d
",max(f[H][0], f[H][1]));
    return 0;
}