Submission #73163677

---

Source Code Expand

#include <algorithm>
//#include <atcoder/all>
//#include <array>
//#include <bitset>
//#include <cmath>
//#include <deque>
#include <iostream>
#include <map>
//#include <numeric>
#include <queue>
//#include <ranges>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define pb push_back
#define fr first
#define sc second
#define sor(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int,int>;
//using pll = pair<ll,ll>;
//using pqdec = priority_queue<int,vector<int>,greater<int>>;
//using pqdecl = priority_queue<ll,vector<ll>,greater<ll>>;
template <typename T>
using graph = vector<vector<T>>;
const ll LLMAX = 9223372*1e10;
const int IMAX = 214*1e7;
/*--------考察--------------------
----------CODING----------------*/
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m,k; cin >> n >> m >> k;
    vector<pint> v(n);
    rep(i,n) cin >> v[i].fr >> v[i].sc;
    vector<vector<ll>> dp(m+1,vector<ll>(n,-IMAX));
    rep(i,n)if(v[i].sc <= m) dp[m-v[i].sc][i] = v[i].fr;
    rep(i,n){
        auto [profit,cost] = v[i];
        for(int j = max(0,i-k); j < i; j++){
            rep(k,m){
                if(k + v[i].sc <= m) dp[k][i] = max(dp[k][i], dp[k+v[i].sc][j] + v[i].fr);
            }
        }
    }
    ll ans = -1;
    rep(i,m+1)rep(j,n) ans = max(ans, dp[i][j]);
    if(ans > 0) cout << ans << endl;
    else cout << "-1\n";
}

Submission Info

Compile Error

./Main.cpp: In function 'int main()':
./Main.cpp:43:14: warning: structured binding declaration set but not used [-Wunused-but-set-variable]
   43 |         auto [profit,cost] = v[i];
      |              ^~~~~~~~~~~~~

Judge Result