Submission #1188297

#TimeUsernameProblemLanguageResultExecution timeMemory
1188297alwaus424Knapsack (NOI18_knapsack)C++20
12 / 100
0 ms328 KiB
#include <iostream>
using namespace std;

int main() {
    int S, N;
    cin >> S >> N;

    int V, W, K;
    cin >> V >> W >> K;

    int maxValue = 0;
    for (int i = 0; i <= K; i++) {
        if (i * W <= S) {
            maxValue = max(maxValue, i * V);
        } else {
            break;
        }
    }

    cout << maxValue << 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...