Submission #793763

#TimeUsernameProblemLanguageResultExecution timeMemory
793763diponkinuKnapsack (NOI18_knapsack)C++14
73 / 100
1085 ms3940 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n, s, v[100005], w[100005], k[100005], a[2005];
signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> s >> n;
	for(int i = 1; i <= n; i++){
		cin >> v[i] >> w[i] >> k[i];
	}
	for(int i = 1; i <= n; i++){
		for(int j = s; j >= w[i]; j--){
			// a[j] = min(a[j], a[j])
			for(int o = min(k[i], j/w[i]); o > 0; o--){
				a[j] = max(a[j], a[j-w[i]*o] + v[i]*o);
			}
		}
	}
	cout << a[s];
}
#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...