提出 #74016587

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
const ll mod = 998244353;

// #include <atcoder/all>
// using mint = atcoder::modint998244353;
// using namespace atcoder;

int main() {
    int n, s, t;
    cin >> n >> s >> t;

    vector<int> p(n), c(n), w(n);
    for (int i=0; i<n; i++) cin >> p[i] >> c[i] >> w[i];
    
    // dp[i][j]: dp[idx][cnt][weight] = max_profit
    vector dp(n+1, vector(n+1, vector<int>(s+1, -1)));
    dp[0][0][0] = 0;
    for (int i=0; i<n; i++) {
      int profit = p[i]-c[i];
      
      for (int j=0; j<=i; j++) {
        for (int k=0; k<=s; k++) {
          if (dp[i][j][k]==-1) continue;
          // skip
          dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k]);
          // take
          if (k+w[i]<=s) dp[i+1][j+1][k+w[i]] = max(dp[i+1][j+1][k+w[i]], dp[i][j][k]+profit);
        }
      }
    }
    
    int ans = INT_MAX;
    for (int j=0; j<=n; j++) {
      for (int k=0; k<=s; k++) {
        if (dp[n][j][k]==-1) continue;
        if (t<=dp[n][j][k]) ans = min(ans, j);
      }
    }
    if (ans==INT_MAX) cout << -1 << endl;
    else cout << ans << endl;

    return 0;
}

提出情報

ジャッジ結果