제출 #1172313

#제출 시각아이디문제언어결과실행 시간메모리
1172313dbekarysKnapsack (NOI18_knapsack)C++20
0 / 100
31 ms25200 KiB
#include <bits/stdc++.h> using namespace std; int dp[2000][100]; signed main() { ios_base::sync_with_stdio(0); cin.tie(); int m,n; cin>> m>>n; int a[n+1],b[n+1]; vector<int>v1,v2; v1.push_back(0); v2.push_back(0); for(int i=1,c;i<=n;i++){ cin>> b[i]>>a[i]>>c; for(int k=0;k<c;k++){ v1.push_back(a[i]),v2.push_back(b[i]); } } for(int i=1;i<=v1.size();i++){ for(int j=1;j<=m;j++){ dp[i][j]=dp[i-1][j]; if(v1[i]<=j){ dp[i][j]=max(dp[i][j],dp[i-1][j-v1[i]]+v2[i]); } } } cout<< dp[v1.size()][m]; }
#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...