제출 #1287772

#제출 시각아이디문제언어결과실행 시간메모리
1287772eri16Knapsack (NOI18_knapsack)C++20
0 / 100
1 ms568 KiB
#include <bits/stdc++.h>
using namespace std;

void subtask_1(int wmax,int n, vector<int> v, vector <int> w, vector <int> k){
    
    cout<<max(k[0],wmax/w[0])*v[0];

    
}





int main(){
    
    int wmax,n;
    
    cin>>wmax>>n;
    
    vector <int> V(n),W(n),K(n);
    
    for (int i=0; i<n; i++){
        cin>>V[i]>>W[i]>>K[i];
    }
    
    if (n==1)
    subtask_1(wmax,n,V,W,K);
    
}
#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...