제출 #484270

#제출 시각아이디문제언어결과실행 시간메모리
484270maxshevKnapsack (NOI18_knapsack)C++14
0 / 100
1 ms280 KiB
#include <bits/stdc++.h> using namespace std; int main() { /* ifstream fin("knapsack.in"); */ int s, n; cin >> s >> n; int v[2001], w[2001], k[2001]; for (int i = 1; i <= n; i++) { cin >> v[i] >> w[i] >> k[i]; } int dp[2001]; for (int i = 1; i <= s; i++) { for (int j = 1; j <= n; j++) { if (i >= w[j]) { dp[i] = max(dp[i - 1], dp[i - w[j]] + v[j]); } } } cout << dp[s] << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...