| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1287773 | eri16 | Knapsack (NOI18_knapsack) | C++20 | 1 ms | 572 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<<min(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 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... | ||||
