| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 164203 | dolphingarlic | Kitchen (BOI19_kitchen) | C++14 | 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>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;
int dp[90001];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m, k, sm = 0;
cin >> n >> m >> k;
if (m < k) return cout << "Impossible", 0;
FOR(i, 0, n) {
int a;
cin >> a;
if (a < k) return cout << "Impossible", 0;
sm += a;
}
memset(dp, -1, sizeof(dp));
dp[0][0] = 0;
FOR(i, 1, m + 1) {
int x;
cin >> x;
for (int j = 90000; ~j; j--) if (~dp[j - x]) {
dp[j] = max(dp[j], dp[j - x] + min(x, n));
}
}
FOR(i, sm, 90001) if (dp[i] >= n * k) return cout << i - sm, 0;
cout << "Impossible";
return 0;
}
