Submission #917997

#	Time	Username	Problem	Language	Result	Execution time	Memory
917997		borisAngelov	Kitchen (BOI19_kitchen)	C++17	0 / 100	1 ms	496 KiB

kitchen

#include <bits/stdc++.h>

using namespace std;

const int maxn = 305;
const int maxsum = maxn * maxn;

int n, m, k;

int a[maxn];
int b[maxn];

bitset<maxsum> dp;

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n >> m >> k;

    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }

    for (int i = 1; i <= m; ++i)
    {
        cin >> b[i];
    }

    dp[0] = true;

    for (int i = 1; i <= m; ++i)
    {
        dp |= (dp << b[i]);
    }

    int target = 0;

    for (int i = 1; i <= n; ++i)
    {
        target += a[i];
    }

    for (int i = target; i < maxsum; ++i)
    {
        if (dp[i] == true)
        {
            cout << i - target << endl;
            break;
        }
    }

    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28