Submission #858327

#	Time	Username	Problem	Language	Result	Execution time	Memory
858327		Trisanu_Das	Kitchen (BOI19_kitchen)	C++17	100 / 100	38 ms	856 KiB

kitchen

#include <bits/stdc++.h>
using namespace std;
 
int n, m, k, a, sum = 0;
vector <int> ks(1e5 + 1, -1e9);
 
int main() {
    cin >> n >> m >> k;
    for (int i = 0; i < n; i++) {
        cin >> a;
        sum += a;
        if (a < k) { cout << "Impossible"; return 0; }
    }
    ks[0] = 0;
    for (int i = 0; i < m; i++) {
        cin >> a;
        for (int j = 1e5; j >= a; j--) ks[j] = max(ks[j], ks[j - a] + min(a, n));
    }
 
    for (int i = sum; i <= 1e5; i++) {
        if (ks[i] < n * k) continue;
        cout << i - sum;
        return 0;
    }
    cout << "Impossible\n";
}

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