#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii=pair<ll,ll>;
const int N=2020;
int s,n;
ll dp[N];
void calc(ll v,ll w){
for(int i=s;i>=w;i--){
dp[i]=max(dp[i],dp[i-w]+v);
}
}
int main(){
cin.tie(0)->sync_with_stdio(0);
cin>>s>>n;
for(int i=0;i<n;i++){
ll v,w,k;cin>>v>>w>>k;
int now=1,kk=k;
while(now<=k){
calc(v*now,w*now);
kk-=now;
now<<=1;
}
calc(v*kk,kk*w);
}
cout<<dp[s];
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |