提出詳細

提出id	提出時刻	ユーザー名	問題	言語	判定状況	判定	実行時間
115007	2023-10-25 09:55:33	arad	G	cpp	16/16	AC	67

#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VS = vector<string>;
using P = pair<ll,ll>;
using VP = vector<P>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define out(x) cout << x << endl
#define dout(x) cout << fixed << setprecision(10) << x << endl
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)(x.size())
#define re0 return 0
#define pcnt __builtin_popcountll
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr int inf = 1e9;
constexpr ll INF = 1e18;
//using mint = modint1000000007;
//using mint = modint998244353;
int di[4] = {1,0,-1,0};
int dj[4] = {0,1,0,-1};

int main(){
    ll n,m;
    cin >> n >> m;
    VL x(n),y(n);
    rep(i,n) cin >> x[i];
    rep(i,n) cin >> y[i];
    VVL dp(n+1,VL(m,-INF));
    dp[0][0] = 0;
    rep(i,n)rep(j,m){
        chmax(dp[i+1][j],dp[i][j]);
        if(j+y[i] < m){
            chmax(dp[i+1][j+y[i]],dp[i][j]+x[i]);
        }
    }
    ll ans = 0;
    rep(j,m) chmax(ans,dp[n][j]);
    out(ans);
}

sample1.txt AC 2
case1.txt AC 2
case2.txt AC 67
case3.txt AC 2
case4.txt AC 18
case5.txt AC 24
case6.txt AC 24
case7.txt AC 43
case8.txt AC 24
case9.txt AC 9
case10.txt AC 63
case11.txt AC 12
case12.txt AC 17
case13.txt AC 31
case14.txt AC 44
case15.txt AC 3
67 AC67 AC