# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1005463 | vjudge1 | 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 <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
int n, m, k, res;
int s1, s2, s3, s4, s5, s6, s7, l;
int dp[100001];
int b[301];
signed main(){
cin >> n >> m >> k;
s7 = inf;
for(int i = 1; i <= n; i++){
cin >> l;
s2 += l;
s7 = min(s7, l);
}
for(int i = 1; i <= m; i++){
cin >> b[i];
s4 += b[i];
}
for(int i = 0; i <= s4; i++)
dp[i] = -inf;
if(s7 < k){
cout << "Imposible";
return;
}
dp[0] = 0;
for(int i = 1; i <= m; i++){
for(int j = s4 - b[i]; j >= 0; --j){
if(dp[j] != inf){
dp[j + b[i]] = max(dp[j + b[i]], dp[j] + min(b[i], n));
}
}
}
s3 = inf;
for(int j = s2; j <= s4; j++){
if(dp[j] >= n * k)
{
cout << j-s2 ;
return;
}
}
cout << "Impossible";
}