제출 #1309726

#제출 시각아이디문제언어결과실행 시간메모리
1309726norrawichzzzKnapsack (NOI18_knapsack)C++20
37 / 100
1097 ms33324 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int W, n;
	cin>>W>> n;
	
	vector<pair<int,int>> a;
	for (int i=0; i<n; i++) {
		int v,w,k;
		cin>> v>> w>> k;
		for (int j=0; j<k; j++) a.push_back({v, w});
	}
	
	vector<int> dp(W+1, 0);
	
	for (auto &x : a) {
		for (int i=W; i>=x.second; i--) {
			dp[i] = max(dp[i],dp[i-x.second]+x.first);
		}
	}
	cout<< dp[W];
} 
#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...