| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1313752 | code_jahidul | Knapsack (NOI18_knapsack) | C++20 | 0 ms | 332 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(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 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... | ||||
