코드#include #include #include using namespace std;struct info{ int wt, wm, bt, bm;};const int INF = 987654321;int n, k,a,b,c,d,dp[103][100003];vector v;int go(int idx, int ti) { // 시간이 오버되면 -INF 반환 if(ti > k) return -INF; if(idx == n) return 0; int &ret = dp[idx][ti]; if(ret != -1) return ret; int walk = go(idx + 1, ti + v[idx].wt) + v[idx].wm; int bike = go(idx + 1, ti + v[idx].bt) + v[i..
