Submission #66739708

---

Source Code Expand

// Mtaylor
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define endl '\n';
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
    cerr << ' ' << H;
    dbg_out(T...);
}
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
typedef long long ll;
const int N = 3e5 + 5;

int dp[3005][3005];
bool vis[3005][3005];
int n, h, m;
int a[N], b[N];

int solve(int i, int j) {
    if (j > h) return 1e9;
    if (i == 0) {
        if (j == h) {
            return 0;
        }
        return 1e9;
    }
    int& rs = dp[i][j];
    if (vis[i][j]) return rs;
    vis[i][j] = 1;
    rs = min(b[i - 1] + solve(i - 1, j), solve(i - 1, j + a[i - 1]));
    return rs;
}

void test_case() {
    memset(dp, -1, sizeof(dp));
    cin >> n >> h >> m;
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
    }
    int ans = 0;
    for (int i = n; i >= 1; i--) {
        for (int j = 0; j <= h; j++) {
            if (solve(i, j) <= m) {
                ans = i;
                break;
            }
        }
        if (ans) {
            break;
        }
    }
    cout << ans << endl;
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) {
        test_case();
    }
    return 0;
}

Submission Info

Judge Result