Submission #73164596

---

Source Code Expand

#include <bits/stdc++.h>
using ll = long long int;
using namespace std;
ll read()
{
    ll k = 0,f = 1;
    char c = getchar();
    while(c < '0' || c > '9')
    {
        if(c == '-')f = -1;
        c = getchar();
    }
    while(c >= '0' && c <= '9')k = k * 10 + c - '0',c = getchar();
    return k * f; // 别忘记标记的负数要乘进去
}
// 调用时用 n=in();
void print(ll x)
{
    if(x < 0)putchar('-'),x = -x;
    if(x < 10)putchar(x + '0');
    else print(x / 10),putchar(x % 10 + '0');
}
// 直接调用 out(n) 就行了
void solve(){
    int n = read(), m = read(), k = read();
    vector<ll>a(n + 1), b(n + 1);
    for(int i = 1; i <= n; i++){
        a[i] = read();
        b[i] = read();
    }
    ll mx = 0;
    for(int st = 1; st <= n; st++){
        ll memo[300][300];
        memset(memo, -1, sizeof(memo));
        auto cal = [&](auto&& self, int st, int yu) -> ll{
            if(yu < 0){
                return LLONG_MIN / 2;
            }
            if(st > n || yu == 0){
                return 0;
            }
            if(memo[st][yu] != -1){
                return memo[st][yu];
            }
            ll ans = 0;
            for(int j = st + 1; j <= st + k; j++){
                ans = max(ans, a[st] + self(self, j, yu - b[st]));
            }
            return memo[st][yu] = ans;
        };
        mx = max(mx, cal(cal, st, m));
    }
    cout << mx;
}
signed main(){
    int T = 1;
    while(T--){
        solve();
    }
    return 0;
}

Submission Info

Judge Result