Submission #1005601

#	Time	Username	Problem	Language	Result	Execution time	Memory
1005601		coolboy19521	Kitchen (BOI19_kitchen)	C++17	0 / 100	28 ms	1188 KiB

kitchen

#pragma GCC optimize("Ofast")
#include"bits/stdc++.h"
#define int long long

using namespace std;

const int sz = 3e2 + 6;

int a[sz], b[sz];
int dp[sz * sz];

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int n, m, k;
    cin >> n >> m >> k;

    int sm = 0;
    bool f = false;

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

        if (a[i] < k) {
            f = true;
        }
    }

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

    sort(b + 1, b + m + 1);

    if (f) {
        goto ex;
    }

    for (int i = 1; i <= m; i ++) {
        for (int j = sz * sz - 1; b[i] < j; j --) {
            if (dp[j - b[i]]) {
                dp[j] = max(dp[j], dp[j - b[i]] + min(b[i], n));
            }
        }

        dp[b[i]] = max(dp[b[i]], min(b[i], n));
    }

    for (int i = sm; i < sz * sz; i ++) {
        if (dp[i] >= n * k) {
            cout << i - sm;
            return 0;
        }
    }

    ex:
    cout << "IMPOSSIBLE";
}

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