제출 #1301601

#제출 시각아이디문제언어결과실행 시간메모리
1301601xnoelKnapsack (NOI18_knapsack)C++20
37 / 100
1095 ms840 KiB
#include <bits/stdc++.h> using namespace std; int main() { long long s,n; cin>>s>>n; vector<long long> v(n), w(n), k(n); for (long long i=0;i<n;i++) cin>>v[i]>>w[i]>>k[i]; vector<long long> dp(s+1,0); for (long long i=0;i<n;i++) { for (long long m=0;m<k[i];m++) { for (long long j=s;j>=w[i];j--) { dp[j]=max(dp[j],dp[j-w[i]]+v[i]); } } } cout<<dp[s]<<"\n"; }
#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...