제출 #635832

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
635832		zeroesandones	Knapsack (NOI18_knapsack)	C++17	12 / 100	1 ms	320 KiB

knapsack

#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;

#define FOR(i, j, k) for (ll i = j; i < (ll) k; ++i)
#define FORD(i, j, k) for (ll i = j; i >= (ll) k; --i)
#define nl "\n"
#define all(x) (x).begin(), (x).end()

#define sc second
#define fr first
#define pb push_back

void solve()
{
    ll s, n;
    cin >> s >> n;

    ll v, w, k;
    cin >> v >> w >> k;

    ll currW = w;
    ll ans = v;
    ll cnt = 1;

    while((currW + w) <= s && cnt < k) {
        ans += v;
        currW += w;
        ++cnt;
    }

    cout << ans << nl;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}

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