Submission #1176907

#	Time	Username	Problem	Language	Result	Execution time	Memory
1176907		tamzid	Knapsack (NOI18_knapsack)	C++20	12 / 100	0 ms	328 KiB

knapsack

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using ll = long long;
#define pb push_back
#define F first
#define S second
#define vii vector<int>
#define vl vector<long long>
#define cinv(v)  for (auto &it : v) cin >> it;
#define coutv(v) for (auto &it : v) cout << it << " "; cout << endl;
using namespace std;
//using namespace __gnu_pbds;
//template<class T> using ordset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void solve()
{
    int s,n;
    cin>>s>>n;
    int v,w,k;
    cin>>v>>w>>k;
    int neww = 0;
    int ans = 0;
    while(neww+w<=s&&k>0)
    {
        ans+=v;
        k-=1;
        neww+=w;
    }
    cout<<ans<<'\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    //int t;cin>>t;while(t--)
        solve();

    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27