제출 #1241625

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

int main(){
   ll s,n;cin>>s>>n;
   vector<ll>a,val;
   for(ll i=1;i<=n;i++){
      ll v,w,k;
      cin>>v>>w>>k;
      for(ll j=0;j<k;j++){
         a.push_back(w);
         val.push_back(v);
      }
   }
   vector<ll>dp(s+1);
   dp[0]=0;
   for(ll i=0;i<a.size();i++){
      for(ll j=s;j>=a[i];j--){
         dp[j]=max(dp[j],dp[j-a[i]]+val[i]);
      }
   }
   cout<<dp[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...