제출 #1313760

#제출 시각아이디문제언어결과실행 시간메모리
1313760code_jahidulKnapsack (NOI18_knapsack)C++20
0 / 100
1 ms332 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int s,n; cin >> s >> n; vector<int>v(n); vector<int>w(n); vector<int>k(n); for(int i=0; i<n; i++){ cin >> v[i] >> w[i] >> k[i]; } // n==1 subtask rafsan vhai if(w[0] > s){ cout << 0 << endl; } else if(k[0]* w[0] <= s){ cout << k[0]* v[0] << endl; }else{ int kp = int(s/w[0]); cout << kp * v[0] << endl; } return 0; }
#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...