제출 #1088631

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1088631		damamila	Knapsack (NOI18_knapsack)	C++14	73 / 100	155 ms	262144 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

#define int long long

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);  
	int s, n;
	cin >> s >> n;
	vector<vector<int>> items(s+1);
	for (int i = 0; i < n; i++) {
		int v, w, k;
		cin >> v >> w >> k;
		int tmp = min(k, s/w);
		for (int i = 0; i < tmp; i++) items[w].push_back(v);
	}
	vector<int> dp(s+1, 0);
	for (int i = 1; i <= s; i++) {
		sort(items[i].rbegin(), items[i].rend());
		//~ cout << i << ": " << endl;
		int tmp = items[i].size();
		int sz = min(tmp, s/i);
		for (int j = 0; j < sz; j++) {
			int v = items[i][j];
			//~ cout << j << " " << v << endl;
			for (int k = s; k >= i; k--) {
				dp[k] = max(dp[k], dp[k-i]+v);
				//~ cout << "HERE: " << k << " " << dp[k] << endl;
			}
		}
	}
	cout << dp[s] << endl;
}

• Subtask 1: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 24 / 24
• Subtask 5: 0 / 27