# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
783920 | TheOpChicken | Kitchen (BOI19_kitchen) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
const int maxN = 350;
long long dp[maxN*maxN], barr[maxN];
int main(){
int n, m, k;
cin >> n >> m >> k;
bool pos = 1;
int t1 = 0, t2 = 0;
for (int i = 0; i < n; i++){
int a;
cin >> a;
if (a < k) pos = 0;
t1 += a;
}
for (int i = 0; i < m; i++){
cin >> barr[i];
t2 += barr[i];
}
if (!pos){
cout << "Impossible" << endl;
return 0;
}
for (int i = 1; i <= t2; i++) dp[i] = -1e15;
dp[barr[0]] = min((long long)barr[0], n);
for (int i = 1; i < m; i++){
for (int j = 0; j <= t2; j++){
if (barr[i] <= j) dp[j] = max(dp[j], dp[j-barr[i]] + min(barr[i], (long long)n));
}
}
for (int i = t1; i <= t2; i++){
if (dp[i] >= n*k){
cout << i-t1 << endl;
return 0;
}
}
cout << "Impossible" << endl;
}